__小明003的博客

Farm IrrigationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6933    Accepted Submission(s): 2966Problem DescriptionBenny has a sp

Wang Xifeng's Little PlotTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 786    Accepted Submission(s): 474Problem Description《D

Key TaskTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1656    Accepted Submission(s): 699Problem DescriptionThe Czech Technica

PondsTime Limit: 1500/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1699    Accepted Submission(s): 542Problem DescriptionBetty owns a lot of

LCSTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 417    Accepted Submission(s): 216Problem DescriptionYou are given two se

C. Kefa and Parktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKefa decided to celebrate his first big sa

链接：http://codeforces.com/problemset/problem/505/B#include using namespace std;int to,res,n,m;int c[105][105][105];int d[105][105];int ans[105];bool vis[105][105][105];void dfs(int v,int co)

链接：http://codeforces.com/problemset/problem/337/D  找到已经被攻击的最远距离的两个点，再遍历其他点到这两点之间的距离，当两点之间的距离都小于d，这符合题意  #include using namespace std;const int maxn=1e5+5;int n,m,d;int a[maxn],dist1[maxn],dist

Anniversary partyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8730    Accepted Submission(s): 3772Problem DescriptionTher

ComputerTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5508    Accepted Submission(s): 2748Problem DescriptionA school boug

Information DisturbingTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2540    Accepted Submission(s): 901Problem Description

GodfatherTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5860 Accepted: 2052DescriptionLast years Chicago was full of gangster fights and strange murd

Tree CuttingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4316 Accepted: 2627DescriptionAfter Farmer John realized that Bessie had installed a "tree-s

Contestants DivisionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9349 Accepted: 2676DescriptionIn the new ACM-ICPC Regional Contest, a special moni

Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11953 Accepted: 5033DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1

DiceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1465    Accepted Submission(s): 749Problem DescriptionThere are 2 special di

胜利大逃亡(续)Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6806    Accepted Submission(s): 2368Problem DescriptionIgnatius再次被魔王抓走了(

Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33039    Accepted Submission(s): 14624Problem DescriptionA ring is

Red and BlackTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12211    Accepted Submission(s): 7601Problem DescriptionThere is a rect

find the nearest stationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 240    Accepted Submission(s): 129Problem DescriptionSince d

Oil DepositsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16742    Accepted Submission(s): 9626Problem DescriptionThe GeoSurvComp

变形课Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 17043    Accepted Submission(s): 6139Problem Description呃......变形课上Harry碰到了一点小

Sum It UpTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4874    Accepted Submission(s): 2553Problem DescriptionGiven a specified

Catch That CowTime Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8764    Accepted Submission(s): 2762Problem DescriptionFarmer John has

连连看Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23806    Accepted Submission(s): 5870Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下

Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14212    Accepted Submission(s): 4488Special JudgeProblem

UntitledTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 828    Accepted Submission(s): 460Problem DescriptionThere is an integer a a

ZipperTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7813    Accepted Submission(s): 2765Problem DescriptionGiven three strings, yo

A strange liftTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14947    Accepted Submission(s): 5654Problem DescriptionThere is a str

Prime PathTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 463    Accepted Submission(s): 305Problem DescriptionThe ministers of the

Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1733    Accepted Submission(s): 604Problem Description《Journey t

链接：http://codeforces.com/problemset/problem/686/D      寻找以i为根的子树的重心  当我们要求ans[i]的时候可以发现ans[i]一定会在i节点儿子中数量最多的子树当中，所以层层往上推 直到ans[i]=i || d[i]-d[ans[i]]#include using namespace std;const int N=3e5+