Submission #1076345

#	Time	Username	Problem	Language	Result	Execution time	Memory
1076345		speedcode	Split the sequence (APIO14_sequence)	C++17	50 / 100	2072 ms	131072 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;

ll dp1[100001][201];
int dp2[100001][201];
int n;
ll Dat[100001];
ll f(int m, int k){
    if(k+1 > n + 1 - m) return 0;
    if(k == 0) return 0;
    if(dp1[m][k] != -1) return dp1[m][k];
    ll res = -1;
    for(int i = m+1; i <= n-k+1; i++){
        ll r = (Dat[i-1] - Dat[m-1])*(Dat[n] - Dat[i-1]) + f(i, k-1);
        if(r >= res){
            res = r;
            dp2[m][k] = i;
        }
    }
    dp1[m][k] = res;
    return res;
}

void solve(){
    int k;
    cin >> n >> k;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= k; j++){
            dp1[i][j] = -1;
            dp2[i][j] = -1;
        }
    }
    Dat[0] = 0;
    for(int i = 1; i <= n; i++){
        cin >> Dat[i];
        Dat[i] += Dat[i-1];
    }

    cout << f(1, k) << '\n';
    int key = 1;
    while(true){
        key = dp2[key][k];
        if(key == -1) break;
        cout << key-1 << ' ';
        k--;
    }
    cout << '\n';
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
}

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