HDU 1231 最大連續子序列

讀清題意

#include<cstdio>#include<cmath>#include<iostream>#include<conio.h>using namespace std;const int maxn=10001;int tab[maxn];int f[maxn];int len[maxn];int main(){//freopen("in.txt","r",stdin);int n;while(scanf("%d",&n)!=EOF){if(!n)break;for(int i=0;i<n;i++)scanf("%d",&tab[i]);len[0]=1;f[0]=tab[0];for(int i=1;i<n;i++){if(f[i-1]<0){f[i]=tab[i];len[i]=1;}else {f[i]=f[i-1]+tab[i];len[i]=len[i-1]+1;}}int maxv=f[n-1],pos=n-1;for(int i=n-1;i>=0;i--){if(maxv<=f[i]){maxv=f[i];pos=i;}}//print outif(maxv<0)printf("0 %d %d\n",tab[0],tab[n-1]);else printf("%d %d %d\n",maxv,tab[pos-len[pos]+1],tab[pos]);}}