Submission #786282

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
786282	2023-07-18 06:06:49	coding_snorlax	Split the sequence (APIO14_sequence)	C++14	50 / 100	2058 ms	36108 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;
using ll = long long int;
//dp[i][k] : from 1-i, cut k line max answer
//dp[i][k] = (List[i]+List[i-1]+...+List[j])^2 + dp[j-1][k-1]
//dp[i][0] = (List[i]+...+List[0])^2
//sigma(block[i][j]) = [sigma([i])^2-sigma([i]^2)]//2
vector<ll> List={};
vector<ll> prefix={0};
ll dp[10002][202]={{0}};
ll back_track[10002][202]={{0}};
// dp[i][j][k] : from i to j cut k times max answer
//vector<int> answer;
void Find_answer(int i,int k){
    //cout << i << " " << j << " " << k << "\n";
    if(k==0) return;
    cout << back_track[i][k] << " ";
    //answer.push_back(back_track[i][j][k][0]+1);
    Find_answer(back_track[i][k]-1,k-1);
}
int main(){
    ll N,K;
    cin>>N>>K;
    for(int i=0;i<N;i++){
        ll num;
        cin>>num;
        List.push_back(num);
        prefix.push_back(prefix.back()+num);
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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