Submission #263155

#	Time	Username	Problem	Language	Result	Execution time	Memory
263155		blackyuki	Split the sequence (APIO14_sequence)	C++14	0 / 100	44 ms	18168 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}

vector<PP> cht;
ll id=0;
void add(ll a,ll b,ll num){
    // out(a);out(b);out(num);
    while(cht.size()){
        if(get<0>(cht.back())==a){
            if(b<=get<2>(cht.back()))return;
            cht.pop_back();
        }
        else break;
    }
    while(cht.size()>1){
        auto p=cht[cht.size()-2],q=cht.back();
        if((a-get<0>(q))*(b-get<1>(p))>(get<1>(q)-b)*(get<0>(p)-a))break;
        cht.pop_back();
    }
    cht.eb(a,b,num);
}
P getma(ll x){
    while(id+1<cht.size()){
        if(get<0>(cht[id])*x+get<1>(cht[id])>get<0>(cht[id+1])*x+get<1>(cht[id+1]))break;
        id++;
    }
    return P(get<0>(cht[id])*x+get<1>(cht[id]),get<2>(cht[id]));
}

int main(){
    ll n,k;cin>>n>>k;
    vi v(n);rep(i,n)cin>>v[i];
    vi rui(n+1);
    rep(i,n)rui[i+1]=rui[i]+v[i];
    vvi dp(k+1,vi(n,-inf));
    dp[0][0]=0;
    vvi f(k+1,vi(n));
    REP(i,1,k+1){
        cht=vector<PP>(0);id=0;
        REP(j,1,n){
            if(dp[i-1][j-1]!=-inf)add(rui[j-1],dp[i-1][j-1]-rui[n]*rui[j-1],j-1);
            // rep(t,j)if(chmax(dp[i][j],dp[i-1][t]+(rui[j]-rui[t])*(rui[n]-rui[j])))f[i][j]=t;
            auto res=getma(rui[j]);
            dp[i][j]=res.fi-rui[j]*rui[j]+rui[n]*rui[j];f[i][j]=res.se;
        }
    }
    ll ans=0;
    rep(i,n)chmax(ans,dp[k][i]);
    out(ans);
    vi t;
    rep(i,n)if(dp[k][i]==ans){
        t.pb(i);break;
    }
    for(int i=k;i>1;i--)t.pb(f[i][t.back()]);
    outv(t);
}

Compilation message (stderr)

sequence.cpp: In function 'P getma(ll)':
sequence.cpp:73:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     while(id+1<cht.size()){
      |           ~~~~^~~~~~~~~~~

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