洛谷 P1941 飞扬的小鸟 完全背包+01背包

上升时看作一个完全背包，下降时看成一个01背包。

#include<iostream>
#include<cstdio>
#include<cstring>
#define MAXN 10010
#define MAXM 2010
#define INF 0x3f3f3f3f
using namespace std;
int n,m,k,x[MAXN],y[MAXN],low[MAXN],high[MAXN],a,b,c,e[MAXN],f[MAXN][MAXM];
int main(){
#ifdef WINE
    freopen("data.in","r",stdin);
#endif
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;i++){
        scanf("%d%d",&x[i],&y[i]);
        low[i]=1;high[i]=m;
    }
    for(int i=0;i<k;i++){
        scanf("%d%d%d",&a,&b,&c);
        e[a]=1;low[a]=b+1;high[a]=c-1;
    }
    memset(f,INF,sizeof(f));
    for(int i=1;i<=m;i++)f[0][i]=0;
    for(int i=1;i<=n;i++){
        for(int j=x[i]+1;j<=m+x[i];j++)
            f[i][j]=min(f[i-1][j-x[i]]+1,f[i][j-x[i]]+1);
        for(int j=m+1;j<=m+x[i];j++)
            f[i][m]=min(f[i][m],f[i][j]);
        for(int j=1;j<=m-y[i];j++)
            f[i][j]=min(f[i][j],f[i-1][j+y[i]]);
        for(int j=1;j<low[i];j++)f[i][j]=INF;
        for(int j=high[i]+1;j<=m;j++)f[i][j]=INF;
    }
    int res=INF;
    for(int j=1;j<=m;j++)res=min(res,f[n][j]);
    if(res<INF)printf("1\n%d\n",res);
    else{
        int i,j;
        for(i=n;i>=1;i--){
            for(j=1;j<=m;j++)
                if(f[i][j]<INF)break;
            if(j<=m)break;
        }
        res=0;
        for(int j=1;j<=i;j++)if(e[j])res++;
        printf("0\n%d\n",res);
    }
    return 0;
}