[DP] BZOJ 1571 [Usaco2009 Open]滑雪课Ski

就是f[i][j]表示到i时刻 j点能力值的最大值

然后DP就好了

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}

inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=10005;
const int C=105;

int last[N][C],p[C];
int f[N][C],g[N];

int n,m,T,cc;
#define V G[p].v
int main(){
  int l,r,c;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(T); read(m); read(n);
  memset(p,0x3f,sizeof(p));
  for (int i=1;i<=m;i++){
    read(l); read(r); read(c); r+=l-1;
    last[r][c]=max(last[r][c],l); cc=max(cc,c);
  }
  for (int i=1;i<=n;i++){
    read(c);read(l); cc=max(cc,c);
    p[c]=min(p[c],l);
  }
  for (int i=2;i<=cc;i++)
    p[i]=min(p[i],p[i-1]);
  for (int i=2;i<=cc;i++) f[0][i]=-1<<30;
  g[0]=0;
  for (int i=1;i<=T;i++){
    for (int j=1;j<=cc;j++){
      f[i][j]=f[i-1][j];
      if (last[i-1][j])
	f[i][j]=max(f[i][j],g[last[i-1][j]]);
      if (i-p[j]>=0)
	f[i][j]=max(f[i][j],f[i-p[j]][j]+1);
    }
    g[i]=-1<<30;
    for (int j=1;j<=cc;j++)
      g[i]=max(g[i],f[i][j]);
  }
  printf("%d\n",g[T]);
  return 0;
}