P1273 有线电视网

别看他n=3000，其实是道O(n^3)的背包！

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
#define rep(i,j,k) for(i=j;i<=k;++i)
#define per(i,j,k) for(i=j;i>=k;--i)
#define sqr(x) ((x)*(x))
#define G getchar()
#define LL long long
#define pii pair<int,int>
#define mkp make_pair
#define X first
#define Y second
#define N 3005
#define inf 1061109568
int n,m,f[N][N],ln[N];
int he[N],ne[N],tot,to[N],W[N];
int read(){
	int x=0;char ch=G;
	while(ch<48||ch>57)ch=G;
	for(;ch>47&&ch<58;ch=G)x=x*10+ch-48;
	return x;
}
void add(int x,int y,int z){
	to[++tot]=y;W[tot]=z;ne[tot]=he[x];he[x]=tot;
}
void dp(int x){
	int i,y,j,k,rg;
	for(i=he[x];i;i=ne[i]){
		dp(y=to[i]);
		per(j,ln[x]+ln[y],1)
			rep(k,max(1,j-ln[x]),ln[y])
				f[x][j]=max(f[x][j],f[x][j-k]+f[y][k]-W[i]);
		ln[x]+=ln[y];
	}
}
int main(){
	int n,m,i,x,y,z;
	n=read();m=read();
	rep(i,1,n-m){
		for(x=read();x--;){
			y=read();z=read();
			add(i,y,z);
		}
	}
	memset(f,192,sizeof f);
	rep(i,n-m+1,n){
		f[i][1]=read();ln[i]=1;
	}
	rep(i,1,n)f[i][0]=0;
	dp(1);x=0;
	rep(i,1,n)if(f[1][i]>=0)x=i;
	printf("%d\n",x);
	return 0;
}