#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=100010, LOG=20;
ll n, m, k, u, v, x, y, t, a, b, ans;
ll A[MAXN], ps[MAXN];
ll dp[2][MAXN];
int opt[201][MAXN];
vector<int> out;
inline ll cost(ll l, ll r){ // (l, r]
return (ps[r]-ps[l])*(ps[r]-ps[l]-1)/2;
}
void divide(int j, int tl, int tr, int optl, int optr){
if (tr<tl) return ;
int mid=(tl+tr)>>1;
for (int i=optl; i<=min(optr, mid-1); i++) if (dp[j&1^1][i]+cost(i, mid)<=dp[j&1][mid]){
dp[j&1][mid]=dp[j&1^1][i]+cost(i, mid);
opt[j][mid]=i;
}
divide(j, tl, mid-1, optl, opt[j][mid]);
divide(j, mid+1, tr, opt[j][mid], optr);
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>k;
for (int i=1; i<=n; i++) cin>>A[i], ps[i]=ps[i-1]+A[i];
for (int i=1; i<=n; i++) dp[0][i]=cost(0, i);
for (int j=1; j<=k; j++){
memset(dp[j&1], 63, sizeof(dp[j&1]));
divide(j, 1, n, 1, n);
}
int pos=n;
for (int i=k; i; i--){
pos=opt[i][pos];
out.pb(pos);
}
reverse(all(out));
cout<<cost(0, n)-dp[k&1][n]<<'\n';
for (int i:out) cout<<i<<' ';cout<<'\n';
return 0;
}
Compilation message
sequence.cpp: In function 'void divide(int, int, int, int, int)':
sequence.cpp:39:53: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
for (int i=optl; i<=min(optr, mid-1); i++) if (dp[j&1^1][i]+cost(i, mid)<=dp[j&1][mid]){
~^~
sequence.cpp:40:20: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
dp[j&1][mid]=dp[j&1^1][i]+cost(i, mid);
~^~
sequence.cpp: In function 'int main()':
sequence.cpp:66:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for (int i:out) cout<<i<<' ';cout<<'\n';
^~~
sequence.cpp:66:31: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
for (int i:out) cout<<i<<' ';cout<<'\n';
^~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
7 ms |
2176 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
6 ms |
2080 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
12 ms |
2944 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
10 ms |
2688 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
11 ms |
2816 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
12 ms |
2944 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
7 ms |
2176 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
7 ms |
2304 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
16 ms |
3712 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
18 ms |
3712 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
16 ms |
3456 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
18 ms |
3712 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
16 ms |
3712 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
8 ms |
2304 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
10 ms |
2688 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
8 ms |
2176 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
2176 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
80 ms |
10848 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
2176 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
69 ms |
7288 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
65 ms |
8172 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
81 ms |
8568 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
58 ms |
7416 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
63 ms |
8184 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
80 ms |
9852 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
27 ms |
4736 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
27 ms |
4600 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
760 ms |
81908 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
4600 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1056 ms |
81784 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
645 ms |
58396 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
784 ms |
62328 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
558 ms |
51304 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
593 ms |
58360 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
756 ms |
73980 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
