Atcoder 500 Static Sushi 思維

题意:一个周长为C的环. 第i件物品距离原点x[i](顺时针),价值为为v[i].走一单位花费为1.
n<=1e5,2<=C<=1e14,1<=v[i]<=1e9.问最多能获得多少价值?


枚举顺时针拿了i个 逆时针拿个j个(j<=n-i) 那么能获得pre[i]+suf[n-j]-x[i]-(C-x[n-j+1])-min([x[i],C-x[n-j+1]) O(n^2) TLE..


因为顺时针拿了i个 那么拿逆时针的的距离要么比它大要么比它小.
这两种情况都可以用优先队列来维护. val= pre[i]-2x[i] + mx , val=pre[i]-x[i] + mx.

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
const int N=2e5+5; 
ll n,C,x[N],v[N],pv[N],sv[N];
priority_queue<ii> q,q2;
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>C;
	for(int i=1;i<=n;i++)
		cin>>x[i]>>v[i],pv[i]=pv[i-1]+v[i];
	ll val=0;
	for(int i=n;i>=1;i--)
	{
		val+=v[i],sv[i]=val;
		q.push(ii(val-(C-x[i]),n-i+1));
	}
	ll res=0,p=1,mx=0;
	for(int i=0;i<=n;i++)
	{
		ll c1=2ll*x[i];
		if(i==0)
			c1=0;
		//case 1
		while(!q.empty()&&(q.top().second>n-i||C-x[n-q.top().second+1]<=x[i]))
			q.pop();
		if(!q.empty())
			res=max(res,pv[i]-c1+max(0ll,q.top().first));	
		//case 2
		while(p<=n-i&&C-x[n-p+1]<=x[i])
			q2.push(ii(sv[n-p+1]-2ll*(C-x[n-p+1]),p)),p++;
		while(!q2.empty()&&(q2.top().second>n-i))
			q2.pop();			
		if(!q2.empty())
			res=max(res,pv[i]-x[i]+max(0ll,q2.top().first));
		res=max(res,pv[i]-x[i]);		
	}
	cout<<res<<'\n';
	return 0;
}

其实可以直接枚举顺时针拿了i个,然后预处理逆时针拿后i+1个时的最优解,

点击打开链接