hdu 1231 最大连续子序列 ，1003 Max Sum；

题目（1231）

#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{
int K,num[10010],cnt;
int end,start,thisMax,Max,temp;
while(cin>>K&&K)
{
cnt=0;
for( int i=0; i<K; i++)
{
scanf("%d",&num[i]);
if(num[i] < 0 )
cnt++;
}
if(cnt == K)
{
printf("%d %d %d\n",0,num[0],num[K-1]);
continue;
}
start = end = 0;
Max = thisMax = num[0];
for( int i=1; i<K; i++ )
{
if(thisMax < 0)
{
temp = i;
thisMax = 0;
}
thisMax += num[i];
if(thisMax > Max)
{
Max = thisMax;
end = i;
start = temp;
}
}
printf("%d %d %d\n",Max,num[start],num[end]);
}
return 0;
}

题目（1003）

#include<stdio.h>
#include<cstring>
#include<iostream>
using namespace std;
int main()
{
int T,cnt=0,n;
int num[100010];
int thisMax,Max,temp;
scanf("%d",&T);
while(T--)
{
int start, end;
memset(num,0,sizeof(num));
cnt++;
scanf("%d",&n);
for(int i=0; i<n; i++)
scanf("%d",&num[i]);
start = end = temp = 0;
thisMax = Max = num[0];

for( int i=1; i<n; i++ )
{
if(thisMax < 0)
{
temp = i;
thisMax = 0;
}
thisMax += num[i];
if(thisMax > Max)
{
Max = thisMax;
end = i;
start = temp;
}
}

if(cnt != 1) printf("\n");
printf("Case %d:\n",cnt);
printf("%d %d %d\n",Max,start+1,end+1);

}
return 0;
}