/*
DEATH-MATCH
Davit-Marg
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>
#include <cassert>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;
int n,k;
LL a[100005],pr[100005],dp[2][100005];
int nxt[202][100005];
LL sum(int l, int r)
{
return pr[r] - pr[l - 1];
}
struct line
{
int i;
LL k, b;
line(LL kk=0, LL bb=0,int ii=0)
{
k = kk;
b = bb;
i = ii;
}
};
LL solve(line p, line q)
{
return (q.b - p.b) / (p.k - q.k);
}
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
pr[i] = pr[i - 1] + a[i];
}
for (int z = 1; z <= k; z++)
{
int i = z % 2;
int l = !i;
vector<line> s;
int ans=0;
for (int j = n; j >= 1; j--)
{
line add = line(pr[j], dp[l][j + 1] - pr[j] * pr[j], j);
while (s.size() > 1 && ((s[s.size() - 1].k == add.k && add.b >= s[s.size() - 1].b) || (s[s.size() - 1].k != add.k && solve(s[s.size() - 1], add) > solve(s[s.size() - 2], add))))
s.pop_back();
s.PB(add);
ans = min(ans, (int)s.size() - 1);
LL X = pr[n] + pr[j - 1];
while (ans < s.size()-1 && s[ans].k*X + s[ans].b <= s[ans + 1].k*X + s[ans + 1].b)
ans++;
dp[i][j] = s[ans].k*X + s[ans].b - pr[j - 1] * pr[n];
nxt[z][j] = s[ans].i;
}
}
cout << dp[k%2][1] << endl;
for (int i = k,l=1; i >= 1; i--)
{
cout << nxt[i][l] << " ";
l = nxt[i][l] + 1;
}
cout << endl;
return 0;
}
/*
3 1
2 1 2
40 3
7 5 7 5 1 2 3 4 6 7 8 2 1 2 3 4 6 7 8 2 7 7 5 1 2 3 4 6 7 8 2 5 1 2 3 4 6 7 8 2
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:77:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while (ans < s.size()-1 && s[ans].k*X + s[ans].b <= s[ans + 1].k*X + s[ans + 1].b)
~~~~^~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
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 |
376 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 |
376 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 |
376 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 |
376 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 |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 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 |
5 ms |
632 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
452 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
1400 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1148 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
1404 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1400 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
424 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
508 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
2168 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
2168 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
26 ms |
1912 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
21 ms |
2168 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
2168 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
760 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
1136 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
1112 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
122 ms |
9944 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
1420 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
72 ms |
6212 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
86 ms |
7116 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
105 ms |
7976 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
80 ms |
6652 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
91 ms |
7456 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
114 ms |
9052 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
39 ms |
9572 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
40 ms |
9520 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1277 ms |
87840 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
48 ms |
10484 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1388 ms |
87224 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
697 ms |
61492 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1072 ms |
68044 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
875 ms |
57040 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
944 ms |
63804 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1176 ms |
79544 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
