// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));
const int INF = 1e9 , mod = 1e9 + 7;
template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }
template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}
template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }
template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }
template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }
template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }
#define PROB "a"
void file(){
if(fopen(PROB".inp", "r")){
freopen(PROB".inp","r",stdin);
freopen(PROB".out","w",stdout);
}
}
void sinh_(){
// srand(time(0));
// freopen(PROB".inp" , "w" , stdout);
// int n;
}
typedef long long ll;
typedef long double db;
const int N = 1e5 + 2;
ll dp[N];
int n, k, a[N], pre[N], pf[N][205];
void readip(){
cin >> n >> k; ++k;
REP(i, 1, n) cin >> a[i];
pre[0] = 0;
REP(i, 1, n) pre[i] = pre[i - 1] + a[i];
}
struct line{
ll a, b;
line(ll _a = 0, ll _b = 0) {
a = _a, b = _b;
}
ll gety(int x) {
return a * x + b;
}
db getintersect(const line &other) {
return 1.0 * db(b - other.b) / db(other.a - a);
}
};
struct convex_hull_trick{
vector<pair<line, int>> dq;
int pt = 0;
void addLine(line newline, int id) {
if (!dq.empty() && newline.a == dq.back().first.a) {
if (newline.b <= dq.back().first.b) return;
dq.pop_back();
}
while(dq.size() >= 2 && dq[SZ(dq) - 2].first.getintersect(newline)
<= dq[SZ(dq) - 2].first.getintersect(dq.back().first))
dq.pop_back();
dq.eb(newline, id);
minimize(pt, SZ(dq) - 1);
}
ll get(int x) {
if (dq.empty()) return -1e18;
while(pt + 1 < SZ(dq) && dq[pt + 1].first.gety(x) > dq[pt].first.gety(x))
++pt;
return dq[pt].first.gety(x);
}
int getpos() {
return dq[pt].second;
}
void init() {
dq.clear();
pt = 0;
}
} CHT;
void solve(){
memset(dp, -0x3f, sizeof dp);
dp[0] = 0;
REP(T, 1, k) {
CHT.init();
if (T == 1) CHT.addLine(line(0, 0), 0);
REP(i, 1, n) {
ll dpi = dp[i];
dp[i] = 1LL * pre[n] * pre[i]
- 1LL * pre[i] * pre[i]
+ CHT.get(pre[i] - pre[n]);
pf[i][T] = CHT.getpos();
if (i >= T - 1) CHT.addLine(line(pre[i], dpi), i);
}
}
vi ans;
int i = n;
REPD(j, k, 2) {
int nxt = pf[i][j];
ans.eb(nxt);
i = nxt;
}
cout << dp[n] << ln;
reverse(ALL(ans));
for (int x : ans) cout << x << ' '; cout << ln;
}
int main(){
sinh_();
io_faster
file();
int t = 1;
// cin >> t;
while (t--){
readip();
solve();
}
}
Compilation message
sequence.cpp: In function 'void readip()':
sequence.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
| ^
sequence.cpp:143:5: note: in expansion of macro 'REP'
143 | REP(i, 1, n) cin >> a[i];
| ^~~
sequence.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
| ^
sequence.cpp:145:5: note: in expansion of macro 'REP'
145 | REP(i, 1, n) pre[i] = pre[i - 1] + a[i];
| ^~~
sequence.cpp: In function 'void solve()':
sequence.cpp:92:28: warning: unnecessary parentheses in declaration of 'T' [-Wparentheses]
92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
| ^
sequence.cpp:202:5: note: in expansion of macro 'REP'
202 | REP(T, 1, k) {
| ^~~
sequence.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
| ^
sequence.cpp:205:9: note: in expansion of macro 'REP'
205 | REP(i, 1, n) {
| ^~~
sequence.cpp:93:29: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
93 | #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
| ^
sequence.cpp:218:5: note: in expansion of macro 'REPD'
218 | REPD(j, k, 2) {
| ^~~~
sequence.cpp:225:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
225 | for (int x : ans) cout << x << ' '; cout << ln;
| ^~~
sequence.cpp:225:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
225 | for (int x : ans) cout << x << ' '; cout << ln;
| ^~~~
sequence.cpp: In function 'void file()':
sequence.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
125 | freopen(PROB".inp","r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
126 | freopen(PROB".out","w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
1116 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1112 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1240 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
1112 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
1116 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
1372 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
3420 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
3416 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
4 ms |
3420 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
3416 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
4 ms |
3420 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
3536 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
3416 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
2 ms |
3468 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
10016 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
10016 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
34 ms |
10076 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
10076 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
25 ms |
10016 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
27 ms |
10016 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
33 ms |
10076 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
23 ms |
10076 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
24 ms |
10016 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
30 ms |
10016 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
86116 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
22 ms |
86732 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
330 ms |
86992 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
23 ms |
86480 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
416 ms |
85460 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
274 ms |
86484 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
317 ms |
86484 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
235 ms |
85456 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
248 ms |
86228 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
308 ms |
85460 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
