shengweisong

做了一上午，终于ac了 wa了一次主要是忘了还有环！！！ 主要是运用并查集知识，又复习了一次！！思路:输入之后找能不能成环，成环就不是，其次还要判断是不是有两个父节点，如果有两个父节点也不是，之后就找相关的祖先就好了；还要注意：如果只有一个节点，也是树，如果有两个或多个根节点也不是树；如果没有根节点也不是链接http://acm.hdu.edu.cn/showproblem.php

The SuspectsTime Limit: 1000MS Memory Limit: 20000K Total Submissions: 24570 Accepted: 12033 DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was rec

D-CityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 2134 Accepted Submission(s): 751Problem Description Luxer is a really bad guy. He des

Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32514 Accepted: 10036DescriptionThe police office in Tadu City decides to say end

A Bug's LifeTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 29030 Accepted: 9455DescriptionBackground Professor Hopper is researching the sexual be

Rank of TetrisTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5428    Accepted Submission(s): 1520Problem Description自从Lele开发了Ra

Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 16832 Accepted: 7068DescriptionAn earthquake takes place in Southeast Asia. The ACM (

Play on WordsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5622    Accepted Submission(s): 1850Problem DescriptionSome of the

find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4022    Accepted Submission(s): 1732Problem Descript

原来想的只是个简单欧拉回路问题

策略： 如题。并查集：并查集是一种树型的数据结构，用于处理一些不相交集合（Disjoint Sets）的合并及查询问题。 说白了就是点的合并与查询。题目链接  http://acm.hdu.edu.cn/showproblem.php?pid=1232代码：#include#includeint fat[1005];int f(int n){ if(fat[n] !=

How Many Tables Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16590 Accepted Submission(s): 8117Problem DescriptionToday is Ignatius’ bir