View Code of Problem 4066

#include <bits/stdc++.h>
using namespace std;
int a[10000010], dp[10000010];
int main(){

    int n;
    while(cin>>n){
        for(int i = 0; i<n; i++){
            scanf("%d", &a[i]);
        }
        int ans = a[0];
        dp[0] = a[0];
        for(int i = 1; i<n; i++){
            dp[i] = max(dp[i-1]+a[i], a[i]);
            ans = max(ans, dp[i]); 
        }
        cout<<ans<<endl;        
    }


    return 0;
}