#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAXK = 2e2+10;
const int MAXN = 1e5+100;
int N, K, a[MAXN], opt[MAXK][MAXN];
ll pref[MAXN], dp[MAXK][MAXN];
void solve(){
cin >> N >> K;
pref[0] = 0;
for(int i = 0; i < N; i++){
cin >> a[i];
pref[i+1] = pref[i] + a[i];
}
for(int k = 1; k <= K; k++){
for(int i = 0; i < N; i++){
opt[k][i] = N;
for(int j = i+1; j < N; j++){
ll lt = pref[j] - pref[i], rt = pref[N] - pref[j];
ll res = dp[k-1][j] + lt * rt;
if(res >= dp[k][i]){
dp[k][i] = res;
opt[k][i] = j - 1;
}
}
}
}
cout << dp[K][0] << "\n";
int k = K, i = 0;
while(k > 0 && opt[k][i] < N){
cout << opt[k][i] + 1 << " ";
i = opt[k][i] + 1;
k--;
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
Compilation message
sequence.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
2 | #pragma GCC optimization("O3")
|
sequence.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
3 | #pragma GCC optimization("unroll-loops")
|
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
876 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
8 ms |
2924 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
6 ms |
2156 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Incorrect |
8 ms |
2668 KB |
Unexpected end of file - int32 expected |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
492 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
3 ms |
492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
149 ms |
4844 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
3 ms |
492 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
149 ms |
4716 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
130 ms |
4076 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
149 ms |
4972 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
156 ms |
4864 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
31 ms |
1260 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
60 ms |
2156 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
225 ms |
876 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
237 ms |
876 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Execution timed out |
2069 ms |
4468 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2041 ms |
1772 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |