yyd_s的博客

//#define local #include<cstdio> #include<iostream> #include<vector> #define MAXN 12 const 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.

//#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.

//#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]=.

//#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队多少人.

//#define local #include<cstdio> #include<iostream> #include<vector> #define MAXN 9 using 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.