题目链接点这里
这道题和POJ2479基本上一模一样,输入方式不一样,数字范围不一样,思路啥的一模一样,可以参考我的上一篇博客
AC代码:
#include <stdio.h>
#define fur(i,a,b) for(int i=(a);i<(b);i++)
#define furr(i,a,b) for(int i=(a);i>(b);i--)
#define max(a,b) ( ((a)>(b)) ? (a):(b) )
#define min(a,b) ( ((a)>(b)) ? (b):(a) )
#define cl(a, b) memset((a),1,sizeof(a))
#define Point int
#define null NULL
#define OFFSET 500000
typedef long long ll;
typedef unsigned long long ull;
const int inf=0x3f3f3f3f;
const double eps=1e-8;
using namespace std;
int main()
{
int T;
int a[100002];
int d[100002],rev_d[100002];
int fir_max[100002],sec_max[100002];
int n;
int res;
while(scanf("%d",&n)!=EOF)
{
if(n==0) break;
res = -9999;
fur(i,0,n)
scanf("%d",&a[i]);
d[0] = a[0];
rev_d[n-1] = a[n-1];
fir_max[0] =d[0];
sec_max[n-1] = rev_d[n-1];
for(int i=1,j=n-2;i<n-1;i++,j--)
{
d[i] = max((d[i-1]+a[i]),a[i]);
fir_max[i] = max(fir_max[i-1],d[i]);
rev_d[j] = max((rev_d[j+1]+a[j]),a[j]);
sec_max[j] = max(sec_max[j+1],rev_d[j]);
}
fur(i,0,n-1)
res = max(res,fir_max[i]+sec_max[i+1]);
printf("%d\n",res);
}
return 0;
}