#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
const double PI = 4 * atan(1);
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>
#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
void io(string taskname){
string fin = taskname + ".in";
string fout = taskname + ".out";
const char* FIN = fin.c_str();
const char* FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
fast_io();
}
const int MAXN = 1e5 + 5;
const int MAXK = 2e2 + 5;
ll dp[MAXK][MAXN];
ll pre[MAXN];
vector<ll> a;
ll get(int l, int r){return pre[r] - (l == 0? 0: pre[l-1]);}
int bef[MAXK][MAXN];
int main(){
fast_io();
int n, k;
cin >> n >> k;
k++;
f0r(i, n){
int ai;
cin >> ai;
a.eb(ai);
if(i == 0) pre[i] = ai;
else pre[i] = pre[i-1] + ai;
}
ll res = pre[n-1]*pre[n-1];
f0r(i, n){
dp[1][i] = get(0, i)*get(0, i);
bef[1][i] = -1;
}
f1r(i, 2, k+1){
int best = i-2;
f1r(j,i-1, n){
while(best+1<j){
ll v1 = dp[i-1][best] + get(best+1, j)*get(best+1, j);
ll v2 = dp[i-1][best+1] + get(best+2, j)*get(best + 2, j);
if(v2<=v1){
best++;
}
else break;
}
dp[i][j] = dp[i-1][best] + get(best+1, j)*get(best+1, j);
bef[i][j] = best;
}
}
res -= dp[k][n-1];
res/=2;
// cout << dp[3][4] << endl;
cout << res << endl;
vi ans;
int f = k;
int s = n-1;
while(bef[f][s] != -1){
ans.eb(bef[f][s]);
s = bef[f][s];
f--;
}
reverse(all(ans));
for(int x: ans) cout << x+1 << " ";
cout << endl;
return 0;
}
Compilation message
sequence.cpp:1:0: warning: ignoring #pragma comment [-Wunknown-pragmas]
#pragma comment(linker, "/stack:200000000")
sequence.cpp: In function 'void io(std::__cxx11::string)':
sequence.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen(FIN, "r", stdin);
~~~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen(FOUT, "w", stdout);
~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
888 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
476 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
2680 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
2040 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
2424 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
2680 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
888 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
1016 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
476 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
4600 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
4600 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Incorrect |
6 ms |
3960 KB |
contestant didn't find the optimal answer: 4698976842 < 4699030287 |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
1144 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
1144 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
39 ms |
26104 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
1144 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
39 ms |
15984 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Incorrect |
34 ms |
18552 KB |
contestant didn't find the optimal answer: 514785562499 < 514790755404 |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
6764 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
19 ms |
6992 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Runtime error |
202 ms |
131076 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
