本来以为只是简单的求出最大子序列就好了,结果又仔细一看题目,还需要区间范围,结果我就懵了,上网百度了一下,发现使用dp. 代码如下:
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAX = 1e6 + 1;
int num[MAX] = { 0 };
int n;
int main()
{
int t; cin >> t;
int cas = 0;
while (t--)
{
cas++;
cin >> n; int sum = 0;
int l, r;
int tmp=1, maxn = -9999;
for (int i = 1; i <= n; i++)
{
scanf_s("%d", num + i);
sum += num[i];
if (sum > maxn)
{
maxn = sum;
r = i;
l = tmp;
}
if (sum < 0)
{
sum = 0;
tmp = i + 1;
}
}
printf("Case %d:\n%d %d %d\n", cas,maxn, l, r);
if (t)
cout << endl;
}
return 0;
}