#include 
    
     #include 
     
      #include 
      
       #include 
       
        #include 
        
         using namespace std;struct node{	int f, s;};vector
         
          imap[40005];int deep[40005];int dis[40005];int fa[40005];int ffa[40005];bool vis[40005];void dfs(int n,int s,int ff){ vis[n] = true; for(int i=0;i
          
           =deep[y]) return lca(fa[x],y); else return lca(x,fa[y]);}int main(){ int t, n, m, c; int u, v, s, ans; node cur; while(scanf("%d%d%d",&n,&m,&c)!=EOF) { memset(vis,false,sizeof(vis)); memset(fa,0,sizeof(fa)); memset(fa,false,sizeof(fa)); memset(dis,0,sizeof(dis)); memset(deep,false,sizeof(deep)); memset(imap,0,sizeof(imap)); for(int i=0;i
          
         
        
       
      
     
    

来自HDU2847

版权声明：本文为博主原创文章，未经博主允许不得转载。