UVa10917 Walk Through the Forest
题目描述 传送门根据题目意思建立DAG,再统计路径条数。代码#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=1005,maxm=(maxn-1)*(maxn-2);
const int INF=1e
原创
2017-10-19 19:36:24 ·
285 阅读 ·
0 评论