제출 #337129

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
337129		bigDuck	Split the sequence (APIO14_sequence)	C++14	0 / 100	64 ms	9156 KiB

sequence

#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll

int t, n, m, k, a[300010], q, l, r;
int dp[1010][210];
int p[1010];




int32_t main(){
INIT
cin>>n>>k;
for(int i=1; i<=n ;i++){
    cin>>a[i];
    p[i]=p[i-1]+a[i];
}

dp[0][0]=0;
k++;

for(int i=1; i<=n; i++){
    for(int g=0; g<=k; g++){
        dp[i][g]=-1;
    }
    for(int j=i-1; j>=0; j--){
        for(int g=0; g<k; g++){
            if(dp[j][g]==-1){continue;}
            if(dp[i][g+1]==(-1)){
                dp[i][g+1]=dp[j][g]+(p[i]-p[j])*(p[i]-p[j]);
            }
            else{
                dp[i][g+1]=min(dp[i][g+1], dp[j][g]+(p[i]-p[j])*(p[i]-p[j]));
            }
        }
    }
}

cout<<( ((p[n]*p[n])-dp[n][k])/2   );


return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29