SMMR-T112: Time Travel

#include <iostream>
#include <vector>
using namespace std;

#define lli long long

vector<int> exp;
int ne;

int main(){

    lli ans = -1e18;

    scanf("%d", &ne);
    exp.assign(ne + 1, 0);
    lli memo[ne + 1];
    for(int i = 1; i <= ne; ++i){
        scanf("%d", &exp[i]);
        memo[i] = 0;
        for(int e = 1; e < i; ++e){
            if(exp[e] < exp[i]){
                memo[i] = max(memo[i], memo[e]);
            }
        }
        memo[i] += exp[i];
        ans = max(ans, memo[i]);
    }

    cout << ans;

    return 0;
}