清溪浅水

Problem DescriptionAnt Country consist of N towns.There are M roads connecting the towns.Ant Tony,together with his friends,wants to go through every part of the country.They intend to vis

DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distrib

#include #include using namespace std;const int M=1005;int head[M];struct node{ int to; int w; int next;}Node[M];int main(){ int n,m; cin>>n>>m; memset(head,-1,size

有一条用彩色珠子做的漂亮项链。每个珠子由两种颜色组成，相继的两个珠子在邻接处共享一种颜色：--(green | red) (red | white) (white | green) (green | blue)--有一天，项链线断了，珠子撒了一地。收集了地上的珠子，但无法肯定是否收齐。想知道用目前收集的珠子是否能够联成项链。输入51    22    33    4

题目：用数轴描述一条高速公路，有V个村庄，每一个村庄坐落在数轴的某个点上，需要选择P个村庄在其中建立邮局，要求每个村庄到最近邮局的距离和最小。分析：经典DP1、考虑在V个村庄中只建立一个邮局的情况，显然可以知道，将邮局建立在中间的那个村庄即可。也就是在a到b间建立一个邮局，若使消耗最小，则应该将邮局建立在（a+b)/2这个村庄上（可以通过画图知道）。2、下面考虑建立多个邮局的问题，可以

DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge

Problem Description有N个比赛队（1 Input输入有若干组，每组中的第一行为二个数N（1 Output给出一个符合要求的排名。输出时队伍号之间有空格，最后一名后面没有空格。其他说明：符合条件的排名可能不是唯一的，此时要求输出时编号小的队伍在前；输入数据保证是正确的，即输入数据确保一定能有一个符合要求的排名。

DescriptionAn ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequenc

给出一个图的结构，输出其拓扑排序序列，要求在同等条件下，编号小的顶点在前输入若干行整数，第一行有2个数，分别为顶点数v和弧数a，接下来有a行，每一行有2个数，分别是该条弧所关联的两个顶点编号输出若干个空格隔开的顶点构成的序列(用小写字母)样例输入6 81 21 31 43 23 54 56 46 5样例输出v1 v3 v2 v6 v4 v

DescriptionYou want to visit a strange country. There are n cities in the country. Cities are numbered from 1 to n. The unique way to travel in the country is taking planes. Strangely, in this stran

DescriptionBessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, makes

Problem DescriptionSome 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, th

Problem Description欧拉回路是指不令笔离开纸面，可画过图中每条边仅一次，且可以回到起点的一条回路。现给定一个图，问是否存在欧拉回路？ Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是节点数N ( 1 束。 Output每个测试用例的输出占一行，若欧拉回路存在则输出1，否则输出0。 Sample

DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distrib