P1941 飞扬的小鸟 题解

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#define ll long long
#define N 10005
using namespace std;
int read()
{
    int ans=0;
    char ch=getchar(),last=‘ ‘;
    while(ch>‘9‘||ch<‘0‘)last=ch,ch=getchar();
    while(ch>=‘0‘&&ch<=‘9‘)ans=(ans<<3)+(ans<<1)+ch-‘0‘,ch=getchar();
    return last==‘-‘?-ans:ans;
}
int n,m,k,p,l,h,judge[N],low[N],hi[N],f[N][2007];
int ans;
struct zbx{
    int a,b;
}zb[N];
int main(){
    n=read(),m=read(),k=read();
    for(int i=1;i<=n;i++)
    {
        zb[i].a=read(),zb[i].b=read();    
    }
    for(int i=1;i<=n;i++)
    {
        hi[i]=m;low[i]=1;
    }
    for(int i=1;i<=k;i++)
    {
        p=read(),low[p]=read()+1,hi[p]=read()-1;
        judge[p]=1;
    }
    memset(f,0x3f,sizeof(f));
    for(int i=1;i<=m;i++)
    {
        f[0][i]=0;//renyigaodu
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=zb[i].a+1;j<=m+zb[i].a;j++)
        {
            f[i][j]=min(f[i-1][j-zb[i].a],f[i][j-zb[i].a])+1;
        }
        for(int j=m+1;j<=m+zb[i].a;j++)
        {
            f[i][m]=min(f[i][j],f[i][m]);
        }
        for(int j=1;j<=m-zb[i].b;j++)
        {
            f[i][j]=min(f[i-1][j+zb[i].b],f[i][j]);
        }
        for(int j=1;j<=m;j++)
        {
            if(j<low[i]||j>hi[i])
            {
                f[i][j]=f[0][0];
            }
        }
    }
    ans=f[0][0];
    for(int j=1;j<=m;j++)
    {
        ans=min(f[n][j],ans);
    }
    if(ans<f[0][0])
    {
        printf("1\n%d\n",ans);
    }
    else
    {
        int i=n,j;
        for(;i>=1;i--)
        {
            for(j=1;j<=m;j++)
            {
                if(f[i][j]<f[0][0])break;
            }
            if(j<m+1)break;
        }
        ans=0;
        for(int kkk=1;kkk<=i;kkk++)
        {
            if(judge[kkk])//判断kkk是否为坏人
            ans++; 
        }
        printf("0\n%d\n",ans);
    }
    return 0;
}