摘要:
我用临接表模拟容器超时#include#include#includeusing namespace std;#define N 110000vectorq[N];int f[N];int main() { int t,n,m,i,j,k,a,b; scanf("%d",&t); whi... 阅读全文
摘要:
/*一组测试实例4 4 23 12 4*/#include#include#includeusing namespace std;#define N 31000struct node {int u,v,next;}bian[N*10];int head[N],yong,indegree[N],n,f... 阅读全文
摘要:
几个比较好的博客http://www.renfei.org/blog/isap.htmlhttp://kenby.iteye.com/blog/945454http://blog.csdn.net/mypsq/article/details/37959249#include#include#incl... 阅读全文