状态压缩动态规划(洛谷)
状压dp
yyd_s
这个作者很懒,什么都没留下…
展开
-
P1879 Corn Fields G
//#define local#include<cstdio>#include<iostream>#include<vector>#define MAXN 12const int mod=1e8;using namespace std;typedef long long ll; int n,m;vector<int>s,p,e;ll dp[MAXN][1<<MAXN]={0};int count(int i){ int r.原创 2022-04-10 09:12:25 · 89 阅读 · 0 评论 -
P2704 炮兵阵地
//#define local#include<cstdio>#include<iostream>#include<vector>#define MAXN 105#define MAXM 11;typedef long long ll;using namespace std;int n,m;int e[MAXN];int dp[2][1<<10][1<<10]={0};vector<int>p,s;int co.原创 2022-04-10 09:11:18 · 160 阅读 · 0 评论 -
P1441 砝码称重
//#define local#include<cstdio>#include<iostream>#define MAXN 20 using namespace std;typedef long long ll;int maxw=0,maxi=0;int n,m;int w[MAXN+1],vis[MAXN+1];int dp[2001];int init(int maxi){ int ans=0; fill(dp,dp+maxi+1,0); dp[0]=.原创 2022-04-10 09:10:07 · 115 阅读 · 0 评论 -
P3694 邦邦的大合唱队
//#define local#include<cstdio>#include<iostream>using namespace std;typedef long long ll;const int MAXN=1e5+5;//人数 n #define MAXM 22//队数 m#define INF 0x7fffffff int dp[1<<MAXM];int sum[MAXN][MAXM]={0};//sum[i][j]表示下标i及其前方有j队多少人.原创 2022-04-10 09:08:52 · 130 阅读 · 0 评论 -
P1896 互不侵犯
//#define local#include<cstdio>#include<iostream>#include<vector> #define MAXN 9using namespace std;typedef long long ll; int n,sk;ll dp[MAXN+1][1<<MAXN][MAXN*MAXN+2]={0};vector<int>s;vector<int>p;int count(i.原创 2022-04-10 09:06:12 · 116 阅读 · 0 评论