#include <bits/stdc++.h>
/// 500 485 462 A4
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
#define endl '\n'
//#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
using namespace std;
const int N=1e5+100,K=210;
ll par[N];
ll a[N];
ll dp[2][N];
int pd[K][N];
void solve(ll l,ll r,ll L,ll R,ll k){
if (l>r) return ;
ll mid=(r+l)/2;
ll best=L,val=-1;
for (int i=L;i<=min(mid,R);i++){
if (val<(par[mid]-par[i-1])*(par[i-1])+dp[((k+1)&1)][i-1]){
best=i;
val=(par[mid]-par[i-1])*(par[i-1])+dp[((k+1)&1)][i-1];
}
}
//cout << l << " " << r << " " << k << " " << best << " " << val << endl;
dp[(k&1)][mid]=val;
pd[k][mid]=best-1;
solve(l,mid-1,L,best,k);
solve(mid+1,r,best,R,k);
}
ll vis[N];
int32_t main(){
sync;
ll n,k;
cin >> n >> k;
// k++;
for (int i=1;i<=n;i++){
cin >> a[i];
par[i]=par[i-1]+a[i];
}
for (int i=1;i<=k;i++){
solve(i+1,n,1,n,i);
}
cout << dp[(k&1)][n] << endl;
vector <int> ans;
ll x=pd[k][n];
ll zz=k;
if (x>0)
ans.pb(x);
while(k!=1){
// cout << x << " " << k << endl;
k--;
x=pd[k][x];
if (x<=0) break;
ans.pb(x);
}
for (auto u : ans){
vis[u]=1;
}
for (int i=1;i<=n;i++){
if (!vis[i] && ans.size()<zz){
ans.pb(i);
}
}
sort(ans.begin(),ans.end());
// reverse(ans.begin(),ans.end());
for (auto u : ans) cout << u << " ";
cout << endl;
}
Compilation message
sequence.cpp: In function 'int32_t main()':
sequence.cpp:67:34: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
67 | if (!vis[i] && ans.size()<zz){
| ~~~~~~~~~~^~~
# |
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 |
0 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
0 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 |
620 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 |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
364 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 |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
2 ms |
1132 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1260 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
8 ms |
2028 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
11 ms |
2028 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
9 ms |
1772 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
8 ms |
2028 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
7 ms |
2028 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
4 ms |
1132 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
2 ms |
876 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
57 ms |
9452 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
76 ms |
5996 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
75 ms |
6804 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
62 ms |
7276 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
42 ms |
6124 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
68 ms |
6904 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
91 ms |
8556 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
31 ms |
4716 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
25 ms |
4716 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
632 ms |
83184 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
20 ms |
5228 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1419 ms |
82844 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
942 ms |
59140 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
702 ms |
63340 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
512 ms |
52176 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
721 ms |
59216 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
841 ms |
75036 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |