//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<bits/extc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
const ll mod = 998244353;
using oset = tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using vec = pair<ll, ll>;
ll dot(vec a, vec b) {
return a.first * b.first + a.second*b.second;
}
struct cht {
vector<vec> hull;
void clear() {
hull.clear();
}
bool nok(ll x, ll y, ll x1, ll y1, ll x2, ll y2) {
double b = (x1 - x)*1.0* (y2 - y1);
double a = (x2 - x1)*1.0* (y1 - y);
return a < b;
}
bool rem() {
int n = hull.size();
if (n < 3)
return 0;
return nok(hull[n - 3].first, hull[n - 3].second, hull[n - 2].first,
hull[n - 2].second, hull[n - 1].first, hull[n - 1].second);
}
void add(vec x) {
hull.pb(x);
while (rem())
swap(hull.back(), hull[hull.size() - 2]), hull.pop_back();
}
vec get(vec x) {
ll l = 0, r = (int)hull.size() - 1, a, b;
while (r - l > 3) {
a = l + (r - l) / 3;
b = r - (r - l) / 3;
if (dot(x, hull[a]) < dot(x, hull[b]))
l = a;
else
r = b;
}
ll ans = 0;
vec z;
while (l <= r) {
ans = max(ans, dot(x, hull[l]));
if(ans==dot(x, hull[l]))
z=hull[l];
l++;
}
return z;
}
};
const int MK = 220, MN = 1e5 + 3;
ll n, a[MN], pref[MN], dp[MK][MN], p[MK][MN];
ll f(ll l, ll r, ll i) {
ll a = pref[i] - pref[l - 1];
ll b = pref[r] - pref[i];
return a * b;
}
vi z;
void bt(int a, int b) {
if(!b)return;
z.pb(b);
if (a > 1)
bt(a - 1, p[a][b]);
}
#define val(j) ((dp[a - 1][(j) - 1] + f(j, n, i)))
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll k;
gp_hash_table<ll, int> bc;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i], pref[i] = pref[i - 1] + a[i];
if (a[i])
bc[pref[i]] = i;
}
ll ans = -1, g = n - 1;
cht x;
for (int a = 1; a <= k; a++) {
x.clear();
// if(a==1)
x.add(vec(0, 0));
for (int i = 1; i < n; i++) {
if(i>=a) {
vec t = x.get(vec(1, pref[n]-pref[i]));
dp[a][i] = dot(t, vec(1, pref[n]-pref[i])) + pref[i]*(pref[n]-pref[i]);
p[a][i] = bc[-t.second];
// cout << -t.real() << " ";
ans = max(ans, dp[a][i]);
if (ans == dp[a][i])
g = i;
}else dp[a][i] = dp[a-1][i];
x.add(vec(dp[a - 1][i], -pref[i]));
}
}
cout << ans << '\n';
bt(k, g);
set<int> xx;
for(auto i : z)
cout << i << " ", xx.insert(i);
int v = 1;
while(z.size() < k) {
while(xx.count(v))v++;
xx.insert(v);
z.pb(v);
cout << v << " ";
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:118:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(z.size() < k) {
~~~~~~~~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
252 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
888 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
508 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
7 ms |
3064 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Incorrect |
6 ms |
2296 KB |
contestant didn't find the optimal answer: 1019625783 < 1019625819 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
35 ms |
5624 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Incorrect |
34 ms |
5624 KB |
declared answer doesn't correspond to the split scheme: declared = 679388324, real = 679388321 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
1780 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
10 ms |
1908 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
464 ms |
35268 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
12 ms |
2288 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Incorrect |
273 ms |
21280 KB |
contestant didn't find the optimal answer: 1085432198 < 1085432199 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
114 ms |
16444 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
111 ms |
16444 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Execution timed out |
2053 ms |
98160 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
