#include <bits/stdc++.h>
#define pb push_back
#define task "sequence"
#define pll pair<ll, ll>
#define pii pair<ll, pll>
#define fi first
#define se second
using ll = int;
const long long mod = 1e12+7;
const ll N = 1e5+5;
const int base = 350;
using ull = unsigned long long;
using namespace std;
ll n, m, t, k, T, a[N], cnt, lab[N], ans, u, tong, v, b[202][N];
long long dp[2][N], c[N];
string s, ss;
vector<ll> kq;
vector<ll> adj[N];
ll pw(ll k, ll n)
{
ll total = 1;
for(; n; n >>= 1)
{
if(n & 1)total = (total * k) % mod;
k = (k * k) % mod;
}
return total;
}
void cal(ll l, ll r, ll opl, ll opr, ll pos)
{
if(l > r)return;
ll mid = (l + r) / 2;
ll best = mid;
dp[1][mid] = -mod;
for(int i = max(opl, pos); i <= min(opr, mid); i ++)
{
if(dp[1][mid] < dp[0][i] + (c[mid] - c[i]) * c[i])
{
dp[1][mid] = dp[0][i] + (c[mid] - c[i]) * c[i];
best = i;
}
}
b[pos][mid] = best;
cal(l, mid-1, opl, best, pos);
cal(mid+1, r, best, opr, pos);
}
void sol()
{
cin >> n >> k;
for(int i = 1; i <= n; i ++)
{
cin >> a[i];
c[i] = c[i-1] + a[i];
//dp[1][i] = -mod;
}
for(int i = 1; i <= k; i ++)
{
cal(1, n, 1, n, i);
for(int j = 1; j <= n; j ++)dp[0][j] = dp[1][j];
//cout << dp[n][i] <<" ";
}
//for(int i = 1; i <= n; i ++)cout << dp[i][1] <<" ";
cout << dp[1][n] << '\n';
t = n;
for(int i = k; i > 0; i --)
{
kq.pb(b[i][t]);
t = b[i][t];
}
for(int i = k-1; i >= 0; i --)cout << kq[i] <<" ";
}
int main()
{
if(fopen(task".in", "r")){
freopen(task".in", "r", stdin);
freopen(task".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ntest;
ntest = 1;
//cin >> ntest;
while(ntest -- > 0)
sol();
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:76:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
76 | freopen(task".in", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:77:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
77 | freopen(task".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
2924 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
2944 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
2796 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
2668 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
3820 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
2788 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
3436 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
3692 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
3820 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
2924 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
2924 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
3052 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2796 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
4460 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2796 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
4460 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
4204 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
4460 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
4480 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
3072 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
3436 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
3180 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
3180 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
74 ms |
11756 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
3180 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
80 ms |
8300 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
79 ms |
9216 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
72 ms |
9580 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
53 ms |
8300 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
74 ms |
9196 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
93 ms |
10860 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
6764 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
29 ms |
6892 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
750 ms |
84332 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
24 ms |
7148 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1489 ms |
84076 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
914 ms |
60444 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
796 ms |
64700 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
543 ms |
53612 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
767 ms |
60652 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
976 ms |
76268 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
