领奖

1 ≤ n ≤ 200000，1 ≤ di,ai ≤ 10^9

http://1572m36l09.iask.in:30808/problem/110

 

模拟费用流

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
const int N=2000000;
typedef long long ll;
priority_queue<ll,vector<ll>,greater<ll> > q1,q2;
int n,i,j,k,l,head[N],adj[N],nxt[N],cap[N],flow[N],cost[N],cur[N],q[N],bg,ed,p[N],pre[N],a[N];
ll dis[N],ans,x,y;
bool v[N];
void addedge(int u,int v,int w,int c)
{
    adj[++l]=v;
    nxt[l]=head[u];
    head[u]=l;
    cap[l]=w;
    cost[l]=c;
    adj[++l]=u;
    nxt[l]=head[v];
    head[v]=l;
    cost[l]=-c;
}
bool spfa()
{
    int i,j;
    for(i=1;i<=n+2;++i)
        v[i]=false,dis[i]=1ll<<60;
    a[n+1]=1<<30;
    v[n+1]=true;
    q[bg=ed=1]=n+1;
    dis[n+1]=0;
    while(bg<=ed)
    {
        v[q[bg]]=false;
        for(i=head[q[bg]];i;i=nxt[i])
            if(flow[i]<cap[i]&&dis[q[bg]]+cost[i]<dis[adj[i]])
            {
                dis[adj[i]]=dis[q[bg]]+cost[i];
                a[adj[i]]=min(a[q[bg]],cap[i]-flow[i]);
                p[adj[i]]=q[bg];
                pre[adj[i]]=i;
                if(!v[adj[i]])
                {
                    v[adj[i]]=true;
                    q[++ed]=adj[i];
                }
            }
        ++bg;
    }
    if(dis[n+2]==(1ll<<60))
        return false;
    ans+=dis[n+2];
    i=n+2;
    while(i!=n+1)
    {
        flow[pre[i]]+=a[n+2];
        flow[pre[i]&1?pre[i]+1:pre[i]-1]-=a[n+2];
        i=p[i];
    }
    return true;
}
int main()
{
    freopen("award.in","r",stdin);
    freopen("award.out","w",stdout);
    scanf("%d",&n);
    if(n<=500)
    {
        for(i=1;i<n;++i)
        {
            scanf("%d",&j);
            addedge(i,i+1,1<<30,j);
            addedge(i+1,i,1<<30,j);
        }
        for(i=1;i<=n;++i)
        {
            scanf("%d",&j);
            addedge(n+1,i,2,j);
            addedge(i,n+2,1,0);
        }
        while(spfa());
        printf("%lld",ans);
        return 0;
    }
    for(i=1;i<n;++i)
    {
        scanf("%d",&j);
        dis[i+1]=dis[i]+j;
    }
    for(i=1;i<=n;++i)//老鼠进洞
    {
        scanf("%d",a+i);
        for(j=1;j<=2;++j)
            if(!q2.empty()&&a[i]+dis[i]+q2.top()<0)
            {
                x=q2.top();
                q2.pop();
                ans+=a[i]+dis[i]+x;
                q1.push(-2*dis[i]-x);
                q2.push(-dis[i]-a[i]);
            }
            else
                q1.push(a[i]-dis[i]);
        x=q1.top();
        ans+=dis[i]+x;
        q1.pop();
        q2.push(-x-2*dis[i]);
    }
    printf("%lld",ans);
    return 0;
}

 

转载于:https://www.cnblogs.com/pthws/p/11148827.html