SMMR-158: Quick Maths

#include <bits/stdc++.h>
using namespace std;
const long long INF=2e18;
using pii=pair<int,int>;
long long dp_min[600][600],dp_max[600][600];
int main(){

    int n,c=2;
    scanf("%d\n",&n);
    int ar[n+1],symbol[n+1];
    scanf("%d",&ar[1]);
    for(int i=2;i<=n;i++){
        char a;
        int x;
        scanf(" %c %d",&a,&x);
        if(a=='-') symbol[i]=-1;
        else symbol[i]=1;
        ar[i]=x;

    }
    for(int i=n;i>=1;i--){
        for(int j=1;j<=n;j++){
            dp_min[i][j] = INF;
            dp_max[i][j] = -INF;
            if(i==j) {
                dp_min[i][j]=ar[i];
                dp_max[i][j]=ar[i];
                continue;
            }
            for(int k=i;k<j;k++){
                if(symbol[k+1] == -1) {
                    dp_min[i][j] = min( dp_min[i][j] , dp_min[i][k] - dp_max[k+1][j]  );
                    dp_max[i][j] = max( dp_max[i][j] , dp_max[i][k] - dp_min[k+1][j] );
                }
                else {
                    dp_min[i][j] = min( dp_min[i][j] , dp_min[i][k] + dp_min[k+1][j] );
                    dp_max[i][j] = max( dp_max[i][j] , dp_max[i][k] + dp_max[k+1][j] );
                }

            }
        }
    }

    printf("%lld %lld",dp_min[1][n],dp_max[1][n]);


    return 0;
}