http://poj.org/problem?id=2762 Going from u to v or from v to u? Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14573 Accepted: 3849 Description In order to make their sons brave, J

http://poj.org/problem?id=2762 问是否任意两点uv都满足u可达v或v可达u 先强连通缩点 然后暴力n^2扫一遍 应该有更好的办法 留坑   #include <cstdio>#include <cstring>#include <algorithm>#include <stack>using namespace std;const int maxn=