제출 #364757

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
364757		ACmachine	수열 (APIO14_sequence)	C++17	100 / 100	1032 ms	85348 KiB

sequence

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e15;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
struct line{
    ll m, c, in;
    long double intersectX(line oth){
        return (long double)(oth.c - c)/(m - oth.m);
    }
    ll eval(ll x){
        return m * x + c;
    }
};
struct hull_trick{
    deque<line> dq;
    void insert(line x){
        while((dq.size() > 0 && dq.front().m == x.m && dq.front().c <= x.c) || (dq.size() > 1 && (dq.front().intersectX(dq[1]) <= x.intersectX(dq.front()))))
            dq.pop_front();
        dq.push_front(x);
    } 
    pll query(ll p){
        while(dq.size() > 1 && dq.back().eval(p) <= dq[(int)dq.size() - 2].eval(p)) 
            dq.pop_back();
        return mp(dq.back().eval(p), dq.back().in);
    }
};
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, k;
    cin >> n >> k;
    vi a(n); cin >> a;
	vector<ll> ps(n + 1, 0);
    REP(i, n){
        ps[i + 1] = ps[i] + a[i];
    }
    vll dp(n + 1, -INFF);
    dp[0] = 0;
    vll new_dp(n + 1, -INFF);
    vector<vi> par_dp(k + 5, vi(n + 1, -1));
    REP(i, k + 1){
        fill(all(new_dp), -INFF);
        hull_trick ht;
        ht.insert({-ps[0], dp[0], 0});
        FOR(j, 1, n + 1, 1){
            pll re = ht.query(ps[n] - ps[j]);
            new_dp[j] = re.ff + ps[j] * (ps[n] - ps[j]);
            par_dp[i][j] = re.ss;
            ht.insert({-ps[j], dp[j], j}); 
        }
        dp.swap(new_dp);
    }
    cout << dp[n] << "\n";
    int lst = n;
    REPD(i, k){
        if(i == 0) break;
        cout << par_dp[i][lst] << " ";
        lst = par_dp[i][lst];
    }
    cout << "\n";
    return 0;
}

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