摘要：湫湫系列故事——设计风景线Time Limit: 6000/3000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 676Accepted Submission(s): 219Problem Description 随着杭州西湖的知名度的进一步提升，园林规划专家湫湫希望设计出一条新的经典观光线路，根据老板马小腾的指示，新的风景线最好能建成环形，如果没有条件建成环形，那就建的越长越好。 现在已经勘探确定了n个位置可以用来建设，在它们之间也勘探确定了m条可以设计的路线以及他们的长度。请.. 阅读全文

摘要：D -SaviorTime Limit:4000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 60DDescriptionMisha decided to help Pasha and Akim be friends again. He had a cunning plan — to destroy all the laughy mushrooms. He knows that the laughy mushrooms can easily burst when th 阅读全文

摘要：Find them, Catch themTime Limit:1000MSMemory Limit:10000KTotal Submissions:23593Accepted:7066DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify whi 阅读全文

摘要：食物链Time Limit:1000MSMemory Limit:10000KTotal Submissions:33156Accepted:9626Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述：第一种说法是"1 X Y"，表示X和Y是同类。第二种说法是"2 X Y"，表示X吃Y。此人对N个动物，用上述两种说法，一句接一句地说出K句话，这K句 阅读全文

摘要：find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1864Accepted Submission(s): 779Problem DescriptionXX星有许多城市，城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构）进行交流，每条SARS都对行驶在上面的Flycar限制了固定的Speed，同时XX星人对 Flycar的“舒适 阅读全文

摘要：More is betterTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 8057Accepted Submission(s): 3001Problem DescriptionMr Wang wants some boys to help him with a project. Because the project is rather complex,the more boys come, the better it will be. 阅读全文

摘要：Play on WordsTime Limit:1000MSMemory Limit:10000KTotal Submissions:7826Accepted:2759DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is very important 阅读全文

摘要：Cube StackingTime Limit:2000MSMemory Limit:30000KTotal Submissions:15705Accepted:5331Case Time Limit:1000MSDescriptionFarmer John and Betsy are playing a game with N (1 #include using namespace std; const int mm=100010; class node { public:int r,u,dis; }g[mm]; int m; void dataset() { for(int i=... 阅读全文

摘要：D - Roads not only in BerlandCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 25D DescriptionBerland Government decided to improve relations with neighboring countries. First of all, it was decided to build new 阅读全文