#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <algorithm>
#include <deque>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair < ll, ll > pll;
const int N = 1e5 + 500;
const int K = 215;
inline bool ccw(const pll &A, const pll &B, const pll &C){
return (ld)A.X * (B.Y - C.Y) + (ld)B.X * (C.Y - A.Y) + (ld)C.X * (A.Y - B.Y) <= 0;
}
int ind[N], a[N];
pll hl[N];
int cur = 0, n, k;
ll P[N], lst[N], dp[N];
int rek2[N], cur_k, sz, cnt[N], rek[N][K];
ll cost, lo = 0, hi = 1e17;
inline void add_2(const pll &X,const int &i){
for(;sz >= 2 && ccw(X, hl[sz - 1], hl[sz - 2]); sz--);
hl[sz] = X; ind[sz++] = i;
cur = min(cur, sz - 1);
}
inline ll get_2(const int &i,const ll &x){
return hl[i].X * x + hl[i].Y;
}
inline int query_2(const ll &x){
if(sz == 0) return -1;
for(; cur + 1 < sz && get_2(cur, x) < get_2(cur + 1, x); cur++);
return cur;
}
inline int dinamika_2(){
sz = 0; cur = 0;
add_2({0, 0}, 0);
for(int i = 1;i <= n;i++){
int r = query_2(P[i]);
rek2[i] = ind[r];
cnt[i] = cnt[ind[r]] + 1;
dp[i] = get_2(r, P[i]) - cost;
add_2({P[i], dp[i] - P[i] * P[i]}, i);
//printf("%lld ", dp[i]);
}
// printf("\n");
cur_k++;
return cnt[n] <= k;
}
inline void add(const pll &X,const int &i){
for(;sz >= 2 && ccw(X, hl[sz - 1], hl[sz - 2]); sz--);
hl[sz] = X; ind[sz++] = i;
cur = min(cur, sz - 1);
}
inline ll get(const int &i,const ll &x){
return hl[i].X * x + hl[i].Y;
}
inline int query(const ll &x){
if(sz == 0) return -1;
for(; cur + 1 < sz && get(cur, x) < get(cur + 1, x); cur++);
return cur;
}
inline void dinamika(){
sz = 0; cur = 0;
for(int i = 0;i < n;i++){
int r = query(P[i]);
dp[i] = -1;
if(r >= 0){
rek[i][cur_k] = ind[r];
dp[i] = get(r, P[i]);
}
if(lst[i] >= 0)
add({P[i], lst[i] - P[i] * P[i]}, i);
lst[i] = dp[i];
}
cur_k++;
}
int main(){
scanf("%d%d", &n, &k);
if(n > 10000) {
for(int i = 0;i < n;i++){
scanf("%d", a + i);
P[i + 1] = a[i] + P[i];
}
//lo = hi = 12;
cost = (lo + hi) / 2;
for(int i = 0;i < 60;i++){
if(dinamika_2()){
hi = cost;
}
else{
lo = cost;
}
cost = (lo + hi) / 2;
//if(lo == hi) break;
}
printf("%lld\n", dp[n] + (ll)cnt[n] * cost);
vector < int > fin;
int cur = n;
for(int i = 0;i < k;i++){
cur = rek2[cur];
fin.PB(cur);
}
reverse(fin.begin(), fin.end());
for(int x : fin)
printf("%d ", x);
printf("\n");
}
else{
//if(n > 50000 && k > 150) return 0;
for(int i = 0;i < n;i++){
scanf("%d", a + i);
P[i] = a[i] + (i ? P[i - 1] : 0);
}
for(int i = 0;i < k;i++)
dinamika();
printf("%lld\n", dp[n - 1]);
vector < int > fin;
int cur = n - 1;
for(int i = k - 1;i >= 0;i--){
fin.PB(rek[cur][i]);
cur = fin.back();
}
reverse(fin.begin(), fin.end());
for(int x : fin)
printf("%d ", x + 1);
printf("\n");
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:102:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &k);
~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:106:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", a + i);
~~~~~^~~~~~~~~~~~~
sequence.cpp:136:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", a + i);
~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
6 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
484 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1280 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
1280 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
1280 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
1280 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1280 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
1280 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1280 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1280 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
9216 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
10 ms |
9216 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
77 ms |
9216 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
9216 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
56 ms |
9336 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
59 ms |
9216 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
88 ms |
9280 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
55 ms |
9216 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
65 ms |
9268 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
79 ms |
9216 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
98 ms |
3960 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
106 ms |
4216 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
95 ms |
5028 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
86 ms |
4352 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
118 ms |
4504 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
122 ms |
4472 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
145 ms |
4956 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
106 ms |
4984 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
108 ms |
4856 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
109 ms |
4856 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
