| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 894950 | Baizho | 수열 (APIO14_sequence) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define int long long
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 2e18;
const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
int n, k, a[N];
ll pr[N], dp[N][205], last[N][205];
struct line {
ld m, b;
int id;
};
vector<line> vec[205];
vector<ld> posx[205];
ld interx(line a, line b) {
return 1.0 * (b.b - a.b) / (a.m - b.m);
}
void add(int kk, line a) {
while(vec[kk].sz >= 2 && (vec[kk].back().m == a.m || interx(vec[kk][vec[kk].sz - 2], vec[kk].back()) > interx(vec[kk][vec[kk].sz - 2], a))) {
vec[kk].pop_back(), posx[kk].pop_back();
}
if(vec[kk].empty()) posx[kk].pb(-inf);
else posx[kk].pb(interx(vec[kk].back(), a));
vec[kk].pb(a);
}
pair<ll, int> get(int kk, ll x) {
ll l = 0, r = posx[kk].sz - 1;
while(l <= r) {
int mid = (l + r) / 2;
if(posx[kk][mid] <= x) l = mid + 1;
else r = mid - 1;
}
l --;
return {x * vec[kk][l].m + vec[kk][l].b, vec[kk][l].id};
}
void Baizho() {
cin>>n>>k;
for(int i = 1; i <= n; i ++) {
cin>>a[i];
pr[i] = pr[i - 1] + a[i];
}
for(int i = 0; i <= n; i ++) for(int j = 0; j <= k; j ++) dp[i][j] = -inf;
dp[0][0] = 0;
add(0, {0, 0, 0});
for(int i = 1; i <= n; i ++) {
for(int kk = 1; kk <= min(i, k); kk ++) {
// for(int j = 0; j < i; j ++) {
// if(dp[j][kk - 1] == -inf) continue;
// + pr[n] * pr[i] - pr[n] * pr[j]
// if(dp[j][kk - 1] - pr[i] * pr[i] + pr[i] * pr[j] > dp[i][kk]) {
// dp[i][kk] = dp[j][kk - 1] - pr[i] * pr[i] + pr[i] * pr[j];
// last[i][kk] = j;
// }
// }
auto got = get(kk - 1, pr[i]);
if(got.ff - pr[i] * pr[i] > dp[i][kk]) {
dp[i][kk] = got.ff - pr[i] * pr[i];
last[i][kk] = got.ss;
}
}
for(int kk = 1; kk <= min(i, k); kk ++) {
add(kk, {1.0 * pr[i], 1.0 * dp[i][kk], i});
}
}
ll pos = 0;
for(int i = 1; i <= n; i ++) {
if(dp[i][k] + pr[n] * pr[i] > dp[pos][k] + pr[n] * pr[pos]) {
pos = i;
}
}
cout<<dp[pos][k] + pr[n] * pr[pos]<<"\n";
vector<int> ans;
while(pos) {
ans.pb(pos);
pos = last[pos][k --];
}
reverse(all(ans));
for(auto x : ans) cout<<x<<" ";
}
signed main() {
// Freopen("nondec");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}