제출 #390021

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
390021		vonatlus	수열 (APIO14_sequence)	C++14	0 / 100	72 ms	131076 KiB

sequence

/// adil sultanov | vonat1us 

#pragma GCC optimize("O3")
//#pragma comment(linker, "/STACK:36777216")

#include<bits/stdc++.h>

#define x first
#define y second
#define pb push_back
#define sz(x) (int) x.size()
#define all(z) (z).begin(), (z).end()
 
using namespace std;

using ll = long long;
using pii = pair<int, int>;                                   

const int MOD = 1e9 + 7; 
const int INF = 1e9 + 1e2;
  
void fin() {
#ifdef AM
    freopen(".in", "r", stdin);
#endif        
}                   

const bool flag = 0;

const int N = 1e5+10;
const int K = 210;

ll p[N], dp[N][K], pr[N][K];

void f(int r, int k) {
    if (k == 1) return;
    int cut = pr[r][k];
    cout << cut+1 << " ";
    f(cut, k-1);
}

struct Line {
    ll k, b, id;
    
    Line() {}
    
    Line(ll k, ll b, int id): k(k), b(b), id(id) {}
    
    ll get(ll x) {
        return x*k + b;
    }

    ll cross(Line l) {
        if (k == l.k) return 0ll;
        return (b-l.b)/(l.k-k);
    }
};

vector<Line> v;

void add(Line l) {
    while (sz(v) > 1 && v.back().cross(l) <= v[sz(v)-2].cross(v.back())) {
        v.pop_back();
    }
    v.pb(l);
}

ll get(ll x) {
    int l = 0;
    int r = sz(v)-2;
    int ans = sz(v)-1;
    while (l <= r) {
        int m = ((l+r) >> 1);
        if (v[m].cross(v[m+1]) >= x) {
            ans = m, r = m-1;
        } else {
            l = m+1;
        }
    }
    return ans;//v[ans].get(x);
}

int n;

void solve(int k) {
    v.clear();        
    for (int i = 0; i < n; ++i) {
        if (i >= k-1) {
            int pos = get(p[i]);
            dp[i][k] = v[pos].get(p[i]);
            pr[i][k] = v[pos].id;
        }
        add(Line(p[i], dp[i][k-1]-p[i]*p[i], i));
    }
}

void ma1n() {
    int k;
    cin >> n >> k;
    k++;
    vector<int> a(n);
    for (int& x : a) {
        cin >> x;
    }
    for (int i = 0; i < n; ++i) {
        p[i] = (i ? p[i-1] : 0ll)+a[i];
    }
    memset(pr, -1, sizeof(pr));
    for (int l = 2; l <= k; ++l) {
        solve(l);
    }
    cout << dp[n-1][k] << "\n";
    f(n-1, k);
} 

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr), fin();
    int ts = 1;
    if (flag) {
        cin >> ts;
    }
    while (ts--) {
        ma1n(); 
    }
    return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29