乐着过一辈子的专栏

/*Colored Sticks Time Limit : 10000/5000ms (Java/Other) Memory Limit : 256000/128000K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Problem DescriptionYou are given a bunch of

/*Eddy's picture Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Font: Times New Roman | Verdana | Georgia Font

Jungle Roads Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4   Accepted Submission(s) : 2Font: Times New Roman | Verdana | Georgia Font

/*Tree Time Limit : 6000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 24 Accepted Submission(s) : 9Font: Times New Roman | Verdana | Georgia Font Size: ← →

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

/*Building BlockTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3894 Accepted Submission(s): 1209Problem DescriptionJohn are playing wi

/*Dragon Balls Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Problem DescriptionFive hundred years later, the

#include#include #include#define MAX 100000000int n, f[27], m;struct road{ int a, b, dis;}r[80];int find(int x){ if(x != f[x]) f[x] = find(f[x]); return f[x];}int merge(int x, int y){

/*Connect the Cities Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Font: Times New Roman | Verdana | Georgia F

/*DescriptionDima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave his room for some reason. But Dima and Inna love each other so much that they decided

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

/*A Bug's Life Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9249 Accepted Submission(s): 2980Problem DescriptionBackground Profess

/*畅通工程再续Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15891 Accepted Submission(s): 4914Problem Description相信大家都听说一个“百岛湖”的地方吧，百岛湖的居民生

/*继续畅通工程Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14325 Accepted Submission(s): 6235Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以

/*还是畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26716 Accepted Submission(s): 11930Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村

#include #include#includestruct point{ int x; int y; int cost;}po[5050];int c[110];int cmp(const void *a, const void *b){ return (*(struct point*)a).cost - (*(struct point*)b).cost;}int

/*畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30393 Accepted Submission(s): 15962Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，

#include#include#include#includeint f[200010], n, idnum, sum[200010];struct tree{ int id; tree *next[52];}root;int finds(char *s){ tree *p = &root, *q; int i, j,

/*小希的迷宫 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 21 Accepted Submission(s) : 7Font: Times New Roman | Verdana | Georgia Font Size: ←

#include#includestruct point{ int x, y, o;}P[100010] ;int f[100010], F[33];void get_Fib(){ F[1] = 1; F[2] = 2; for(int i = 3; F[i] <= 30; ++i) F[i] = F[i-1] + F[i-2];}int find(int x){

/*Zjnu Stadium Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Font: Times New Roman | Verdana | Georgia Font Si

问题描述Farmer John变得非常懒，他不想再继续维护供奶牛之间供通行的道路。道路被用来连接N个牧场，牧场被连续地编号为1到N。每一个牧场都是一个奶牛的家。FJ计划除去P条道路中尽可能多的道路，但是还要保持牧场之间 的连通性。你首先要决定那些道路是需要保留的N-1条道路。第j条双向道路连接了牧场Sj和Ej(1 j j j != Ej)，而且走完它需要Lj的时间。没有两个牧场是被一条以上