#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
using namespace std;
#define vint vector<int>
#define aint(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
//#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {int x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<ll> read(ll n) {vector<ll> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vector<ll> pref;void build(vector<ll> a){pref.pb(0LL);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}ll get(ll l, ll r){return pref[r]-pref[l-1];}};//mesanu
const int K = 200;
const int N = 1e5;
int best[N+5][K+5];
deque<pair<pair<ll, ll>, ll>> lines[K+5];
const double eps = 1e-5;
long double intersection_point(ll first_slope, ll first_b, ll second_slope, ll second_b)
{
return (long double)(second_b-first_b)/(long double)(first_slope-second_slope);
}
void insert(ll m, ll b, ll k, ll index)
{
if(m == lines[k].front().fr.fr)
{
if(b > lines[k].front().fr.sc)
{
lines[k].pop_front();
}
else
{
return;
}
}
while(lines[k].size() > 1 && intersection_point(m, b, lines[k].front().fr.fr, lines[k].front().fr.sc)+eps > intersection_point(lines[k].front().fr.fr, lines[k].front().fr.sc, lines[k][1].fr.fr, lines[k][1].fr.sc))
{
lines[k].pop_front();
}
lines[k].push_front({{m, b}, index});
}
pair<ll, int> get_line(ll x, ll k)
{
while(lines[k].size() >= 2 && lines[k].back().fr.fr*x+lines[k].back().fr.sc <= lines[k][lines[k].size()-2].fr.fr*x + lines[k][lines[k].size()-2].fr.sc)
{
lines[k].pop_back();
}
return {lines[k].back().fr.fr*x+lines[k].back().fr.sc, lines[k].back().sc};
}
void solve()
{
int n, k;
cin >> n >> k;
vector<ll> a = read(n);
prefix_sum pref;
pref.build(a);
for(int i = 0; i <= k; i++)
{
deque<pair<pair<ll, ll>, ll>> x;
x.push_back({{0, 0}, 0});
lines[i] = x;
}
ll ans = 0;
int start = 0;
for(int i = 0; i < n-1; i++)
{
vector<ll> now_vals(k+1);
for(int j = min(k, i+1); j >= 1; j--)
{
pair<ll, int> best_line = get_line(pref.get(i+2, n), j-1);
now_vals[j] = best_line.fr+pref.get(1, i+1)*pref.get(i+2, n);
best[i+1][j] = best_line.sc;
if(now_vals[j] >= ans && j == k)
{
start = i+1;
ans = now_vals[j];
}
insert(-pref.get(1, i+1), now_vals[j], j, i+1);
}
}
cout << ans << endl;
while(k != 0)
{
cout << start << " ";
start = best[start][k--];
}
cout << endl;
}
int32_t main(){
startt
int t = 1;
//cin >> t;
while (t--) {
solve();
}
}
/*
7 3
4 1 3 4 0 2 3
*/
/*
introduci o linie - m = -sum 0..i b = dp[i][k]
get o linie - k = k-1 coordonatul sum i..n
*/
Compilation message
sequence.cpp: In member function 'void prefix_sum::build(std::vector<long long int>)':
sequence.cpp:20:679: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {int x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<ll> read(ll n) {vector<ll> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vector<ll> pref;void build(vector<ll> a){pref.pb(0LL);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}ll get(ll l, ll r){return pref[r]-pref[l-1];}};//mesanu
| ~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
648 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
1364 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
1420 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
1364 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1364 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
1688 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1364 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1364 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
8968 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
9096 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
82 ms |
10128 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
9096 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
55 ms |
9856 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
59 ms |
9464 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
73 ms |
9940 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
61 ms |
10160 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
74 ms |
9856 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
76 ms |
9912 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
54 ms |
85624 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
53 ms |
86100 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
990 ms |
97304 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
58 ms |
87176 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
921 ms |
95328 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
606 ms |
90672 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
776 ms |
96176 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
636 ms |
95092 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
688 ms |
94984 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
794 ms |
95364 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
