hdu1003.....暑期集训第一天动态规划WA了4次......

最新推荐文章于 2019-07-31 14:38:00 发布

team79

最新推荐文章于 2019-07-31 14:38:00 发布

阅读量788

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/hzh_0000/article/details/9243419

版权

动态规划专栏收录该内容

296 篇文章 0 订阅

订阅专栏

#include <iostream>
using namespace std;

int main(){
	int T, a[100000], maxsum, first, end, pos, number, n, startfrom;

	cin >> T;
	n = 1;
	while( T-- ){
		cin >> number;
    	for( int i = 0; i < number; i++ ){
    		cin >> a[i];
   		}

		first = end = pos = 0;
		maxsum = 0;
		maxsum = startfrom = a[0];
		for( int i = 1; i < number; i++ ){

			if( startfrom + a[i] < a[i] ){
				pos = i;
				startfrom = a[i];
			}else{
				startfrom += a[i];
			}
			
			if( startfrom > maxsum ){
				maxsum = startfrom;
				first = pos;
				end = i;
			}
		}

		cout << "Case " << n << ":" << endl;
		cout << maxsum << " " << first  + 1 << " " << end + 1 << endl;
		if( T ){
			cout << endl;
		}
		n++;
	}
	return 0;
}