杭电ACM1003 最大子数组之和

#include<iostream>
#include <vector>
using namespace std;


int main() 
{      
	int casenumb;
	int start, end;
	int Perline;
	//int a[20][10000];
	vector< vector<int>> a(20);
	
	cin>>casenumb;
	for (int i=1;i<=casenumb;i++)
	{
		cin>>Perline;
		a[i-1].push_back(Perline);
		int j=1;
		int temp2;
		while (j<=Perline)
		{
			cin>>temp2;
			a[i-1].push_back(temp2);
			j++;
		}
		
	}
	for (int i=1; i<=casenumb;i++)
	{
		cout<<"Case "<<i<<":"<<endl;
	
		int s = 0,max = a[i-1][1];
		start = end = 1;
		for(int j = 1; j <= a[i-1][0]; j++)
		{
			if(s < 0)
			{
				s = a[i-1][j];
				start = j;
			}
			else
				s += a[i-1][j];
			if(max < s)
			{
				max = s;
				end = j;
			}
		}
		cout<<max<<" "<<start<<" "<<end<<endl;
		if (i<casenumb)
		{
			cout<<endl;
		}
		
	}
	
	system("pause");
	return 0; 
}