HDU1003 - Max Sum （最大连续子串和）

题目链接: HDU1003 - Max Sum

解题思路

代码

#include <iostream>
#include <cstdio>

using namespace std;
const int inf = 0x7fffffff;

int main()
{
int n, num, t, tt=1;
bool first = true;

scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
int maxsum = -inf;
int ans_s = 0, ans_e = 0;
int cur = 1, sum = 0;

for(int i=1; i<=n; i++)
{
scanf("%d", &num);
sum += num;
if(sum>maxsum)
{
maxsum = sum;
ans_s = cur;
ans_e = i;
}
if(sum<=0)
{
sum = 0;
cur = i+1;
}
}
if(first)
{
first = false;
printf("Case %d:\n%d %d %d\n", tt++, maxsum, ans_s, ans_e);
}
else
{
printf("\nCase %d:\n%d %d %d\n", tt++, maxsum, ans_s, ans_e);
}
}
return 0;
}