题意
状态转移方程f[i]=max(f1[i-1]+f2[i])
#include <cstdio>
#include <climits>
#include <cctype>
#include <algorithm>
using namespace std;
int t,f1[50002],f2[50002],a[50002];
inline int in(){
char x=getchar(); int f=1,go=0;
while (!isdigit(x)&&x!='-') x=getchar();
if (x=='-') f=-f,x=getchar();
while (isdigit(x)) go=go*10+x-48,x=getchar();
return go*f;
}
int main(){
t=in();
while (t--){ int n;
n=in(); int tmp=0,ans=INT_MIN;
f1[0]=f2[n+1]=INT_MIN;
for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
tmp=max(a[i],tmp+a[i]);//当前最大值
f1[i]=max(f1[i-1],tmp);//到i时的最大值
} tmp=0;
for (int i=n;i>=1;i--){
tmp=max(a[i],tmp+a[i]);//当前最大值
f2[i]=max(f2[i+1],tmp);//到i时的最大值
ans=max(ans,f1[i-1]+f2[i]);
}
printf("%d\n",ans);
} return 0;
}