soj#547 bzoj5046 分糖果游戏

分析

代码

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e9+;
int f[][],s[],p[],v[];
signed main(){
    int n,m,i,j,k,A,B;
    scanf("%lld%lld%lld",&n,&A,&B);
    for(i=;i<=n;i++)scanf("%lld%lld",&p[i],&v[i]);
    for(i=n;i>;i--)s[i]=s[i+]+v[i];
    for(i=;i<=v[n];i++)f[n][i]=-inf;
    for(i=v[n]+;i<=s[n];i++)f[n][i]=inf;
    for(i=n-;i>;i--)
      for(j=;j<=s[i];j++){
          if(v[i]>=j)f[i][j]=-inf;
            else f[i][j]=-(f[i+][s[i]-j+]-)-p[i];
            int res=max(1ll,f[i+][j]+p[i]+);
            if(j<=s[i+]&&f[i][j]>res)f[i][j]=res;
      }
    int Ans;
    for(i=;i<=s[];i++)
      if(A-B>=f[][i])Ans=i;
        else break;
    cout<<Ans<<' '<<s[]-Ans<<endl;
    return ;
}