摘要： http://poj.org/problem?id=1236#include#include#include#include#includeusing namespace std;vector g[1002];int pre[1002],low[1002],lt_num,c,scc_num[1002],scc,in0[1002],out0[1002],n,a,b;stack s;void dfs(int u){ int i,v; pre[u]=low[u]=c++; s.push (u); for(i=0;ib?a:b;}int main(){ int i,q;... 阅读全文