Envío 2265

Código

#include <bits/stdc++.h>
#define ii              pair<int,int>
#define F               first
#define S               second
#define pb              push_back
#define all(x)          (x).begin(),(x).end()
#define rall(x)         (x).rbegin(),(x).rend()
#define fore(i, a, b)   for(int i = a; i < b; i += 1)
#define forr(i, a)      for(int i = a; i >= 0; i--)
#define sz(s)           int(s.size())
#define cls(a,car)      memset(a,car,sizeof (a))
#define db(x)           cout << #x << " is " << x << '\n'
#define angle(x)        double(x * acos(-1) / 180.0)
using namespace std;
void debug(){cout << endl;}
template<typename T, typename... Args>
void debug(T a, Args... args){cout << a << " "; debug(args...);}
typedef long long   ll;
typedef vector<int> vi;
typedef vector<ii>  vii;
const int N = 2e5 + 5;
const ll mod = 1e9 + 7;
const double E = 1e-7;
const int oo = 1e9;

ll dp[N][3], v[N];
int n;
ll f(int i, int val){
    if(i == n)return (val > 0 ? 0 : -1e10);
    ll &ans = dp[i][val];
    if(ans == -1){
        ans = -1e10;
        if(!val){
            ans = max(ans, f(i + 1, 1) + v[i]);
            ans = max(ans, f(i + 1, 0));
        }else if(val == 1){
            ans = max(ans, f(i + 1, 1) + v[i]);
            ans = max(ans, f(i + 1, 2));
        }else{
            ans = max(ans, f(i + 1, 2));
        }
    }
    return ans;
}
void solve(){
    cin >> n;
    for(int i = 0; i < n; i++)cin >> v[i];
    cls(dp, -1);
    cout << f(0, 0) << '\n';
}
int main(){
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
       ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #endif

    int t = 1;
    //cin >> t;
    for(int i = 1; i <= t; i++)
        solve();

    #ifdef LOCAL
        cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    #endif
    return 0;
}