제출 #365168

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
365168		YJU	수열 (APIO14_sequence)	C++14	100 / 100	998 ms	83832 KiB

sequence

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,Ofast")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e5+5;
const ll K=2e2+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll dp[2][N],n,k,u[N];
int from[K][N];
vector<ll> ans;

deque<pair<pll,ll> > dq;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>k;
	REP1(i,n)cin>>u[i],u[i]+=u[i-1];
	REP1(i,n)dp[0][i]=-INF;
	dp[0][0]=0;
	REP1(T,k+1){
		dq.clear();
		dq.pb(mp(mp(0,dp[(T-1)&1][0]),0));
		REP1(i,n){
			while(SZ(dq)>1&&dq[0].X.X*u[i]+dq[0].X.Y<=dq[1].X.X*u[i]+dq[1].X.Y)dq.pop_front();
			
			dp[T&1][i]=dq[0].X.X*u[i]+dq[0].X.Y;
			from[T][i]=dq[0].Y;
			
			ll a=u[i],b=dp[(T-1)&1][i]-u[i]*u[i];
			while(SZ(dq)>1){
				ll m=SZ(dq)-1;
				if((b-dq[m].X.Y)*(dq[m-1].X.X-dq[m].X.X)<=(dq[m].X.Y-dq[m-1].X.Y)*(dq[m].X.X-a))dq.pop_back();
				else break;
			}
			dq.pb(mp(mp(a,b),i));
		}
	}
	cout<<dp[(k+1)&1][n]<<"\n";
	for(int T=k+1,i=n;T>=1&&from[T][i];T--){
		ans.pb(i=from[T][i]);
	}
	reverse(ans.begin(),ans.end());
	REP(i,k)cout<<ans[i]<<(i==k-1?"\n":" ");
	return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/

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