CodeForces - 21D Traveling Graph【状压DP】【欧拉回路】
题目链接:https://codeforces.com/contest/21/problem/D
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
static const int MAXN=15;
int f[MAXN][MAXN],d[MAXN];
int dp[1<<MAXN];
int n,m,u,v,w;
int ans;
int main
原创
2020-10-27 14:25:38 ·
89 阅读 ·
0 评论