uva507

ＪＩＬＬ要去骑车，每段路都有相应的值，问哪两个站之间值最大。

其实就是最大子序列问题，问哪几个连续的值加来最大。

每加上一个站的值，如果比之前最大值要大，就更新最大值，如果没之前大，就不管。

如果值变为负数了，就把值变成０，从下一个开始继续加。

#include<iostream>
using namespace std;
const int N = 20000 + 5;
int n;
int num[N];
int cas = 0;
int main () {
	int c;
	cin >> c;
	while (c--) {
		cin >> n;
		cas++;
		int k = 0;
		for (int i = 1 ; i < n;i++) {
			cin >> num[i];
			if (num[i] < 0 )
				k++;
		}
		if (k == n - 1) {
			cout << "Route " << cas <<" has no nice parts\n";
		}
		else {
			int sum = 0 ;
			int  m = 0;
			int s1 = 1;
			int s2 = 1;
			int e = 1;
			for (int i = 1 ; i < n ;i++) {
				sum += num[i];
				if (sum < 0 ) {
					sum = 0;
					s1 = i + 1;
				}
				if (sum > m || (sum == m && i - s1 > e - s2)) {
					m = sum;
					s2 = s1;
					e = i;
				}
			}
			cout << "The nicest part of route "<< cas <<" is between stops "<<s2 <<" and "<< e + 1 << endl;
		}

	}
}