#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
const int BLN = 10;
int x, k;
int arr[100005];
int pfx[100005];
int64_t dp[100005][2];
int last[100005][205];
inline int sum_query(int l, int r) {
return pfx[r] - pfx[l-1];
}
void dnc(int lvl, int l, int r, int optl, int optr) {
if (l>r) {
return;
}
int m = (l+r)>>1;
std::pair<int64_t,int> opt(-0x3f3f3f3f3f3f3f3f,-0x3f3f3f3f);
for (int i = std::max(0, optl-BLN); i < std::min(m, optr+1+BLN); i++) {
opt = std::max(opt,std::pair<int64_t,int>(1LL*sum_query(i+1,m)*sum_query(m+1,x)+dp[i][(lvl-1)&1], i));
}
dp[m][lvl&1] = opt.first;
last[m][lvl] = opt.second;
dnc(lvl,l,m-1,optl,opt.second);
dnc(lvl,m+1,r,opt.second,optr);
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
std::cin >> x >> k;
for (int i = 1; i <= x; i++) {
std::cin >> arr[i];
pfx[i] = pfx[i-1] + arr[i];
}
++k;
for (int i = 1; i <= k; i++) {
dnc(i,1,x,1,x);
}
std::cout << dp[x][k&1] << "\n";
int i = x, j = k;
std::vector<int> stk;
while (j) {
if (i!=x) stk.emplace_back(i);
i = last[i][j];
--j;
}
int last = 0;
while (!stk.empty()) {
std::cout << stk.back() << " ";
stk.pop_back();
}
std::cout << "\n";
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:62:6: warning: unused variable 'last' [-Wunused-variable]
62 | int last = 0;
| ^~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2648 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
2648 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
2652 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
2652 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
2648 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
2648 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
4744 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
4700 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
4740 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
4700 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
4700 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
4700 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
4752 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
10844 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
10904 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
104 ms |
10844 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
10844 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
126 ms |
10844 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
129 ms |
10872 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
90 ms |
10844 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
68 ms |
10840 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
107 ms |
10840 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
132 ms |
10844 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
52 ms |
83036 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
46 ms |
83036 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1153 ms |
83036 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
42 ms |
83284 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Execution timed out |
2055 ms |
83036 KB |
Time limit exceeded |
| 6 |
Halted |
0 ms |
0 KB |
- |
