pku 1170 Shopping Offers dp+状态压缩
摘要:
//挺好的题目 蛮经典的#include <iostream>using namespace std;const int MAXN = 6*6*6*6*6;int dp[MAXN];int product[5][3];int hash[1000];int offer_price[105];int offer[105][5];int getNum(int a[5]){int num = ... 阅读全文
posted @ 2009-07-20 22:01 ZAFU_VA 阅读(341) 评论(0) 推荐(0)
浙公网安备 33010602011771号