#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef pair<ll,int32_t> pint;
typedef vector <ll> vi;
typedef vector <pi> vpi;
#define f first
#define s second
#define FOR(i,s,e) for(int32_t i=s;i<=int32_t(e);++i)
#define DEC(i,s,e) for(int32_t i=s;i>=int32_t(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0)
#define maxk 201
#define maxn 100001
#define int ll
typedef pair <pi,int32_t> pii;
typedef long double ld;
int32_t N,K,A[maxn];
ll ss[maxn];
deque <pii> dq;
int32_t pre[maxn][maxk];
inline int readInt() {
int x = 0;
char ch = getchar_unlocked();
while (ch < '0' || ch > '9') ch = getchar_unlocked();
while (ch >= '0' && ch <= '9'){
x = (x << 3) + (x << 1) + ch - '0';
ch = getchar_unlocked();
}
return x;
}
static inline int f(pi line, int32_t i){
return line.f * i + line.s;
}
static inline pint query(int x,int32_t i){
while (dq.size() > 1){
if (dq[1].s > i) break;
if (f(dq[0].f,x) < f(dq[1].f,x)){
dq.pop_front();
}else break;
}
return pint(f(dq[0].f,x),dq[0].s);
}
static inline ld intersect(pi line1,pi line2){
return ld(line1.s - line2.s) / ld(line2.f - line1.f);
}
static inline void insert(pi line,int32_t i){
while (dq.size() > 1){
if (intersect(dq.back().f,line) <= intersect(dq[dq.size() - 2].f,line)){
dq.pop_back();
}else break;
}
dq.pb(pii(line,i));
}
int32_t main(){
fast;
N = readInt(); K = readInt();
FOR(i,1,N) A[i] =readInt(),ss[i] = ss[i-1] + A[i];
vector <pii> cur;
FOR(j,0,K){
FOR(i,j+1,N){
int res;
if (i == 1) res = 0;
else if (j == 0) res = 0;
else{
pint a = query(ss[i],i);
res = a.f;
pre[i][j] = a.s;
}
if (i == N && j == K) cout<<res<<'\n';
cur.pb(pii(pi(ss[i],res - ss[i] * ss[i]),i));
//cout<<dp[i][j]<<' ';
}
dq.clear();
aFOR(k,cur) insert(k.f,k.s);
cur.clear();
//while (!cur.empty()) insert(cur.back().f,cur.back().s),cur.pop_back();
//cout<<'\n';
}
int32_t cr = pre[N][K];
cout<<cr<<' ';
DEC(i,K-1,1){
cout<<pre[cr][i]<<' ';
cr = pre[cr][i];
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
404 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
512 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
1280 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
1280 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
1152 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
1152 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
11 ms |
1152 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
8828 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
10 ms |
8828 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
76 ms |
8828 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
8956 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
67 ms |
8828 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
76 ms |
8828 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
71 ms |
8956 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
56 ms |
8828 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
66 ms |
8828 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
80 ms |
8828 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
59 ms |
84528 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
79 ms |
84684 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
929 ms |
85476 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
58 ms |
85472 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1073 ms |
84704 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
786 ms |
84704 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
767 ms |
85480 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
602 ms |
85348 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
686 ms |
85092 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
868 ms |
85092 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
