제출 #337430

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
337430		ogibogi2004	수열 (APIO14_sequence)	C++14	78 / 100	1617 ms	100276 KiB

sequence

#include<bits/stdc++.h>
using namespace std;
#define ld long double
#define ll long long
const ld INF=2e9;
const ll MAXN=1e5+6;
const ll MAXK=222;
ll dp[MAXN][2],a[MAXN];
int last[MAXN][MAXK];
struct line
{
	ld a,b;
	ll pos;
	ld llersect(line const& other)
	{
		if(a==other.a)return -INF;
		return (ld)(other.b-b)/(a-other.a);
	}
	ld gety(ld x)
	{
		return a*x+b;
	}
};
struct ConvexHull
{
	deque<pair<line,double> >dq;
	void add(line l)
	{
		while(!dq.empty()&&l.llersect(dq.back().first)<=dq.back().second)
		{
			dq.pop_back();
		}
		if(dq.empty())dq.push_back({l,-INF});
		else dq.push_back({l,l.llersect(dq.back().first)});
	}
	pair<ld,int> query(ld x)
	{
		while(dq.size()>1&&dq[1].second<=x)dq.pop_front();
		//cout<<dq.front().first.a<<" "<<dq.front().first.b<<endl;
		return {dq.front().first.gety(x),dq.front().first.pos};
	}
}ch[2];
ll n,k;
ll pref[MAXN];
int main()
{
	cin>>n>>k;
	for(ll i=1;i<=n;i++)
	{
		cin>>a[i];
		pref[i]=pref[i-1]+a[i];
	}
	/*for(ll i=0;i<=n;i++)
	{
		for(ll j=0;j<=k+1;j++)dp[i][j]=-INF;
	}*/
	//for(ll i=1;i<=k+1;i++)ch[i].add({0,-INF});
	ch[0].add({0,0,0});
	for(int j=1;j<=k+1;j++)
	{
		ch[j%2].dq.clear();
		ch[j%2].add({0,-INF,-1});
		for(int i=1;i<=n;i++)
		{
			tie(dp[i][j%2],last[i][j])=ch[1-j%2].query(pref[i]);
			//cout<<i<<" "<<j<<" "<<last[i][j]<<endl;
		}
		for(int i=1;i<=n;i++)
		{
			ch[j%2].add({(ld)pref[i],(ld)dp[i][j%2]-pref[i]*pref[i],i});
		}
	}
	cout<<dp[n][1-k%2]<<endl;
	vector<ll>v;
	ll n1=n;
	for(ll i=k;i>=1;i--)
	{
		v.push_back(last[n1][i+1]);
		//cout<<n1<<" "<<i+1<<endl;
		n1=last[n1][i+1];
	}
	/*
	for(ll i=k;i>=1;i--)
	{
		for(ll l1=l-1;l1>=0;l1--)
		{
			if(dp[l1][i]+(pref[l]-pref[l1])*pref[l1]==dp[l][i+1])
			{
				v.push_back(l1);
				l=l1;
				break;
			}
		}
	}*/
	sort(v.begin(),v.end());
	for(auto xd:v)
	{
		if(xd>=1&&xd<=n)cout<<xd<<" ";
	}
	cout<<endl;
return 0;
}

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