SRM 722, D2, 250-Pointer (HillClimber)

James S. Plank

Thu Oct 12 21:42:55 EDT 2017

Problem Statement.
A main() with the examples compiled in.
A skeleton that compiles with main.cpp.
Problem Given in Topcoder: October, 2017
Competitors who opened the problem: 199
Competitors who submitted a solution: 187
Number of correct solutions: 164
Accuracy (percentage correct vs those who opened): 82.4%
Average Correct Time: 9:13.

This is a "run through the vector, keeping track of stuff" problem. When you're solving this, think about what "stuff" you want to keep track of -- there are really two things:

The longest number of consecutive uphill segments that you have seen.
The current number of consecutive uphill segments that you are looking at.

Since you calculate whether a segment is uphill by looking at the difference between two consecutive vector entries, start your for loop at an index of 1 and not 0. You will always look at an entry and the one before it.