#include <bits/stdc++.h>
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define all(lmao) lmao.begin(), lmao.end()
using namespace std;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
const int N = 2e5 + 5;
const int oo = -1e12;
const int K = 205;
const int mod = 998244353;
//const int base = 23;
int n, k, a[N], f[N][K], dp[N][K], s[N];
int cal(int i,int j){
return (s[j] - s[i]) * (s[n] - s[j]);
}
void solve(int j,int l,int r,int pl,int pr){
if(l > r) return;
int mid = (l + r) / 2;
for(int i = pl; i <= min(mid - 1, pr); i ++){
int val = dp[i][j - 1] + cal(i, mid);
if(val > dp[mid][j]){
dp[mid][j] = val;
f[mid][j] = i;
}
}
// cout << mid << " " << j << " " << dp[mid][j] << " " << f[mid][j] << "k\n";
solve(j, l, mid - 1, pl, f[mid][j]);
solve(j, mid + 1, r, f[mid][j], pr);
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define task "v"
if(fopen(task ".inp","r")){
freopen(task ".inp","r",stdin);
freopen(task ".out","w",stdout);
}
cin >> n >> k;
for(int i = 1; i <= n; i ++){
cin >> a[i];
s[i] = s[i - 1] + a[i];
}
if(k == 0){
cout << 0;
return 0;
}
for(int j = 0; j <= k; j ++){
for(int i = 0; i <= n; i ++){
dp[i][j] = oo;
}
}
for(int i = 1; i <= n; i ++) dp[i][1] = s[i] * (s[n] - s[i]), f[i][1] = 0;
for(int j = 2; j <= k; j ++){
solve(j, j, n, 1, n);
}
int ans = oo, tmp = 0, cnt = k;
for(int i = 1; i <= n; i ++){
if(ans < dp[i][k]){
ans = dp[i][k];
tmp = i;
}
}
cout << ans << "\n";
if(n > 1e5) return 0;
vector<int> vr;
vr.pb(tmp);
while(f[tmp][cnt]){
vr.pb(f[tmp][cnt]);
tmp = f[tmp][cnt];
cnt--;
}
for(int i = vr.size() - 1; i >= 0; i --) cout << vr[i] << " ";
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:45:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
45 | freopen(task ".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:46:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
46 | freopen(task ".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
6648 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
3 ms |
6492 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
6492 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
8536 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
6 ms |
8540 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
8536 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
8 ms |
8540 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
6 ms |
8680 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
6 ms |
8540 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
5 ms |
8540 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
4 ms |
8540 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
37468 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
7 ms |
37468 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
71 ms |
37464 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
6 ms |
37468 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
64 ms |
37468 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
68 ms |
37468 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
64 ms |
37464 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
50 ms |
37468 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
68 ms |
37464 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
78 ms |
37468 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
47 ms |
131072 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |