Блог пользователя Brandon983

Автор Brandon983, история, 7 лет назад, По-английски

Hi, I'm really perplexed by this problem. If anyone could give me pointers, that would be greatly appreciated.

My submission is http://codeforces.com/contest/446/submission/33328941 and it failed on problem 41. I'm really confused on how the answer could be 4. The possible subsegments of length 4 created from [7 2 3 1 4 5] are [7 2 3 1] [2 3 1 4] [3 1 4 5] and none of them can be turned into strictly increasing arrays when changing only up to one element.

Maybe I totally misinterpreted the problem but if that's the case, I don't know how I manged to get 40 problems correct...

Полный текст и комментарии »

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится