# include <bits/stdc++.h>
# define pb push_back
# define fr first
# define sc second
# define mk make_pair
using namespace std;
const int inf = 1e9 + 7;
const int N = 1e5 + 5;
typedef long long ll;
int n, k, p[201][N];
ll pref[N];
ll dp[2][N];
ll get(int l, int r)
{
return pref[l] * (pref[r] - pref[l]);
}
void dv(int k, int l, int r, int opl, int opr)
{
if(l > r) return ;
int md = (l + r) >> 1, kk = 1 - (k % 2);
p[k][md] = opl;
for(int i = opl; i <= min(md - 1, opr); i ++)
{
ll now = dp[kk][i] + get(i, md);
if(dp[k % 2][md] <= now)
{
dp[k % 2][md] = now;
p[k][md] = i;
}
}
dv(k, l, md - 1, opl, p[k][md]);
dv(k, md + 1, r, p[k][md], opr);
}
int main()
{
scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i ++)
{
scanf("%lld", &pref[i]);
pref[i] += pref[i - 1];
}
for(int i = 1; i <= k; i ++)
dv(i, i, n, i, n);
cout << dp[k % 2][n] << endl;
for(int i = k; i >= 1; i --)
{
printf("%d ", p[i][n]);
n = p[i][n];
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:46:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &k);
^
sequence.cpp:50:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", &pref[i]);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
82880 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
82880 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
82880 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
82880 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
82880 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
82880 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
82880 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
82880 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
63 ms |
82880 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
82880 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
59 ms |
82880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
63 ms |
82880 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
89 ms |
82880 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
56 ms |
82880 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
59 ms |
82880 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
69 ms |
82880 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
82880 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
26 ms |
82880 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
833 ms |
82880 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
26 ms |
82880 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1166 ms |
82880 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
703 ms |
82880 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
853 ms |
82880 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
596 ms |
82880 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
706 ms |
82880 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
819 ms |
82880 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
