When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

GokuSSJ7's blog

By GokuSSJ7, history, 4 years ago, In English

for a sequence of positive integers a1, a2, a3, ..., an and a number d. You can select a consecutive sub-segment in the sequence a1, a2, a3, ..., an and increase that sub-segment to x (-d <= x <= d).What is the longest increase in a substring length you have? (With n <= 100000 and d <= 1000000000 and a[i]<=1000000000 with from 1 to n) (Since this is my school essay, I don't have any links, so sorry).

  • Vote: I like it
  • -13
  • Vote: I do not like it

| Write comment?