随笔分类 -  【状态DP】

【POJ】1038 Bugs Integrated, Inc.
摘要:1 #include<cstdio> 2 #include<cstring> 3 #include<vector> 4 #include<algorithm> 5 #define MAXN 160 6 #define MAXM 20 7 #define MAXL 280 8 using namespace std; 9 int n,m; 10 bool land[MAXN][MAXM]; 11 int put[MAXL][MAXM],cnt[MAXL],tmp[MAXM],size; 12 vector<int>G[MAXL]; 13 阅读全文
posted @ 2012-07-12 21:30 DrunBee 阅读(344) 评论(0) 推荐(0)
【POJ】1185 炮兵阵地
摘要:1 #include<cstdio> 2 #include<cstring> 3 #include<algorithm> 4 using namespace std; 5 #define MAXN 110 6 #define MAXM 66 7 char s[MAXN][MAXM]; 8 int n,m,size; 9 int dp[MAXN][MAXM][MAXM]; 10 int h[MAXN],a[MAXN],cnt[MAXN]; 11 inline bool OK(int x) 12 { 13 if(x&(x<<1)) 14 re 阅读全文
posted @ 2012-07-12 02:54 DrunBee 阅读(253) 评论(0) 推荐(0)
【HDU】1400 Mondriaan's Dream
摘要:1 #include<cstdio> 2 #include<cstring> 3 #include<vector> 4 #include<algorithm> 5 typedef __int64 LL; 6 using namespace std; 7 #define MAXN 1<<11 8 #define MAXM 15 9 int n,m;10 vector<int>G[MAXN];11 LL dp[MAXM][MAXN];12 bool OK(int a,int b)13 {14 int i,temp,cnt;15 阅读全文
posted @ 2012-07-11 22:12 DrunBee 阅读(258) 评论(0) 推荐(0)