#include <iostream>
#include <vector>
#include <deque>
#define int long long
using namespace std;
struct ln
{
int m;
int c;
int num;
ln(int _m, int _c, int _nm) : m(_m), c(_c), num(_nm) {}
friend double presek(const ln l1, const ln l2) { return (double)(l2.c - l1.c) / (double)(l1.m - l2.m); }
int operator()(int x) { return m*x + c; };
};
int km[100005];
int32_t par[205][100005];
vector<int> dp(100005);
vector<int> ndp(100005);
deque<ln> dq;
int32_t main()
{
cin.tie(NULL);
cout.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> km[i];
km[i] += km[i-1];
}
for (int i = 1; i <= k+1; i++)
{
dq.clear();
for (int j = 1; j <= n; j++)
{
ln tr(km[j-1], dp[j-1]-km[n]*km[j-1], j-1);
while (dq.size() >= 2 && presek(tr, dq[dq.size()-1]) <= presek(dq[dq.size()-2], tr))
dq.pop_back();
dq.push_back(tr);
while (dq.size() >= 2 && dq[0](km[j]) <= dq[1](km[j]))
dq.pop_front();
ndp[j] = dq[0](km[j]) + km[j]*km[n]-km[j]*km[j];
par[i][j] = dq[0].num;
}
dp = ndp;
}
cout << dp[n] << '\n';
int32_t tr = n;
for (int i = k+1; i > 1; i--)
{
tr = par[i][tr];
cout << tr << " ";
}
cout << "\n";
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
3932 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
3928 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
2 ms |
3932 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
2 ms |
3932 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
2 ms |
3928 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
2 ms |
4184 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
2 ms |
3932 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3896 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
5 ms |
22364 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
2 ms |
8028 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
4 ms |
12124 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
2 ms |
8028 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
2 ms |
5980 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
2 ms |
8028 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 ms |
3932 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
15 ms |
82004 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
12 ms |
57436 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
14 ms |
73820 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
15 ms |
82012 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
5 ms |
20316 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
3 ms |
14172 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
5 ms |
24412 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
4100 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
19 ms |
82000 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
3932 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
20 ms |
82108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
17 ms |
69724 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
20 ms |
82012 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
18 ms |
82000 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
5 ms |
18268 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
9 ms |
34880 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4188 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
4188 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
70 ms |
82288 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
4188 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
56 ms |
51536 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
57 ms |
57604 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
56 ms |
61764 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
49 ms |
51496 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
52 ms |
57596 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
64 ms |
73996 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
5724 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
18 ms |
5980 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
554 ms |
84564 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
17 ms |
6236 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
655 ms |
83712 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
474 ms |
60984 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
449 ms |
63520 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
376 ms |
53316 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
450 ms |
61536 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
541 ms |
76372 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |