Submission #6008789

---

Source Code Expand

#include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;


template<typename T,typename U>istream & operator >> (istream &i,pair<T,U> &A){i>>A.F>>A.S; return i;}
template<typename T>istream & operator >> (istream &i,vector<T> &A){for(auto &I:A){i>>I;} return i;}
template<typename T,typename U>ostream & operator << (ostream &o,pair<T,U> &A){o<<A.F<<" "<<A.S; return o;}
template<typename T>ostream & operator << (ostream &o,vector<T> &A){ll i=A.size(); for(auto &I:A){o<<I<<(--i?" ":"");} return o;}
template<typename T>vector<T> & cset(vector<T> &A,T e=T()){for(auto &I:A){I=e;} return A;}



int main(){
    ll N;
    cin>>N;
    vector<ll> A(N);
    cin>>A;
    for(int i=1;i<N;i++){A[i]+=A[i-1];}
    auto sum=[&](ll l,ll r){return A[r]-(l==0?0:A[l-1]);};
    vector<vector<ll>> dp(N,vector<ll>(N,0));
    vector<vector<ll>> K(N,vector<ll>(N,0));
    for(int i=0;i<N;i++){dp[i][i]=sum(i,i); K[i][i]=i;}
    for(int i=1;i<N;i++){
        for(int j=0;j+i<N;j++){
            dp[j][i+j]=E;
            ll l=K[j][i+j-1],r=K[j+1][i+j];
            for(ll k=l;k<=r;k++){
                ll L=dp[j][k];
                ll R=(k+1<=i+j?dp[k+1][i+j]:0LL);
                if(dp[j][i+j]>L+R){
                    dp[j][i+j]=L+R;
                    K[j][i+j]=k;
                }
            }
            dp[j][i+j]+=sum(j,i+j);
        }
    }
    cout<<dp[0].back()-sum(0,N-1)<<endl;
    
    return 0;
}

Submission Info

Judge Result