@[Taki](/space/show?uid=175567)
这里给出一种做法。
```cpp
//f[i]=max(f[i-1]+a[i],a[i]);
#include <bits/stdc++.h>
using namespace std;
const int N=234567;
int n,f[N],ans,a[N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",a+i);
f[i]=max(f[i-1]+a[i],a[i]);
if(i==1)
ans=f[1];
ans=max(ans,f[i]);
}
printf("%d",ans);
return 0;
}
```
by Smile_Cindy @ 2019-07-12 08:51:47