摘要:
http://poj.org/problem?id=1837 1 #include 2 #include 3 const int N=15002; 4 int dp[21][N]; 5 int main() 6 { 7 int n,num; 8 int dis[21],w[21]; 9 memset(dp,0,sizeof(dp));10 scanf("%d%d",&n,&num);// n钩子数,num砝码数11 for (int i = 1; i <= n; i ++)12 scanf("%d",&dis[i]);13 阅读全文
posted @ 2013-09-19 10:53
N_ll
阅读(177)
评论(0)
推荐(0)

浙公网安备 33010602011771号