Submission #647067

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
647067	2022-10-01 13:50:16	google	Split the sequence (APIO14_sequence)	C++17	50 / 100	2076 ms	32572 KiB

sequence

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int szn = 10001,szk=201;
ll dp[szn][szk],arr[szn],pre[szn],n,k;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;
    for (int i = 0;i<n;i++) {
        cin >> arr[i];
        pre[i] = arr[i];
        if (i) pre[i] += pre[i-1];
    }
    memset(dp,0,sizeof(dp));
    for (int c = 1;c<=k;c++){
        for (int i = c;i<n;i++){
            for (int j = 0;j<i;j++){
                if (dp[i][c] < dp[j][c-1]+(pre[j]*(pre[i]-pre[j]))){
                    dp[i][c] = dp[j][c-1]+(pre[j]*(pre[i]-pre[j]));
                }
            }
        }
    }
    cout << dp[n-1][k] << '\n';
    int t = n-1, c = k;
    vector<ll> ans;
    for (int i = n-2;;i--){
        if (dp[t][c] == dp[i][c-1]+pre[i]*(pre[t]-pre[i])){
            ans.push_back(i+1);
            t = i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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