http://acm.hdu.edu.cn/showproblem.php?pid=1231
dp的题目大部分只要找出状态方程就很好做,本题是
if (current<0)
{
current=a[i];
temp=a[i];
}
else
current+=a[i];
if (current>res)
{
res=current;
first=temp;
last=a[i];
}
current是当前的要判断的值,当他是负数时,总体更新头尾节点,刷新最大值,从头dp就能解决有多个最大子序列的问题,且判断是不能是大于等于。下面是源代码
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
using namespace std;
#define Max 10001
int max(int a,int b) {if (a>b) return a; else return b;}
int first,last,n,res;
int a[Max];
int main()
{
int i,temp;
for (;;)
{
cin>>n;
memset(a,0,sizeof(a));
if (!n) {break;}
else
{
for (i=0;i<n;i++)
cin>>a[i];
}
res=a[0];
first=a[0];
last=a[0];
int current=0;
for (i=0;i<n;i++)
{
if (current<0)
{
current=a[i];
temp=a[i];
}
else
current+=a[i];
if (current>res)
{
res=current;
first=temp;
last=a[i];
}
}
if (res<0) {printf("0 %d %d\n",a[0],a[n-1]);}
else {printf("%d %d %d\n",res,first,last);}
}
return 0;
}