제출 #531867

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531867		new_acc	Split the sequence (APIO14_sequence)	C++14	0 / 100	79 ms	131076 KiB

sequence

#include<bits/stdc++.h>
#define fi first
#define se second
#define ll double
using namespace std;
typedef vector<ll> vi;
typedef vector<ll> vl;
const int N=1e5+10;
deque<int> deq[201];
pair<ll,int> dp[N][201];
int sp[N],t[N];
ll wz(int j,int i,int id){
	return dp[j][id].fi-(ll)sp[j]*(ll)sp[j]+(ll)sp[j]*(ll)sp[i];
}
long double prz(int x,int y,int id){
	ll b1=dp[x][id].fi-(ll)sp[x]*(ll)sp[x];
	ll a1=sp[x];
	ll b2=dp[y][id].fi-(ll)sp[y]*(ll)sp[y];
	ll a2=sp[y];
	if(a1==a2) return 1e18;
	return (long double)(b2-b1)/(long double)(a1-a2);
}
void del(int id,int i){
	while(deq[id].size()>1){
		int p=deq[id].front();
		deq[id].pop_front();
		int d=deq[id].front();
		if(wz(p,i,id)>wz(d,i,id)){
			deq[id].push_front(p);
			break;
		}
	}
}
void dod(int id,int i){
	while(deq[id].size()>1){
		int p=deq[id].back();
		deq[id].pop_back();
		int d=deq[id].back();
		if(prz(p,i,id)==1e18){
			if(dp[p][id].fi-(ll)sp[p]*(ll)sp[p]>=dp[i][id].fi-(ll)sp[i]*(ll)sp[i]){
				deq[id].push_back(p);
				return;
			}
			continue;
		}else{
			if(prz(p,i,id)>prz(d,i,id)){
				deq[id].push_back(p);
				break;
			}
		}
	}
	deq[id].push_back(i);
}
void solve(){
	int n,k;
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>t[i];
		sp[i]=sp[i-1]+t[i];
	}
	deq[0].push_back(0);
	for(int i=1;i<=n;i++){
		for(int j=min(k,i);j>=1;j--){	
			del(j-1,i);
			dp[i][j]={wz(deq[j-1].front(),i,j-1),deq[j-1].front()};
			deq[j].push_back(i);
			dod(j,i);
		}
		dod(0,i);
	}
	cout<<dp[n][k].fi<<"\n";
	int curr=n;
	for(int i=k;i>=1;i--){
		curr=dp[curr][i].se;
		cout<<curr<<" ";
	}
	cout<<"\n";
}
int main(){
	solve();
}

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