本文共 756 字,大约阅读时间需要 2 分钟。
#include #include #include #include #include #include #include #include #include #include using namespace std; #define MM(a) memset(a,0,sizeof(a)) typedef long long ll; typedef unsigned long long ULL; const int mod = 1000000007; const double eps = 1e-10; const int inf = 0x3f3f3f3f; const int big=50000; int max(int a,int b) {return a>b?a:b;}; int min(int a,int b) {return a =0;j--) { if(!dp[j]) continue; for(int k=1;k<=m;k++) { if(j&(1<<(k-1))) continue; if(!fi[i][k]) continue; dp[j|(1<<(k-1))]+=dp[j]; } dp[j]=0; } int ans=0; for(int i=0;i<=(1<
转载地址:http://jtgsi.baihongyu.com/