新月

Problem DescriptionC国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段，所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人数都有可能发生变动，可能增加或减少若干人手,但这些都逃不过C国的监视。

DescriptionFarmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his field is particularly good. Fa

Problem DescriptionLillian is a clever girl so that she has lots of fans and often receives gifts from her fans.One day Lillian gets some segments from her fans Lawson with lengths of 1,2,3...

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2555    Accepted Submission(s): 1200Problem DescriptionTom owns a company and he i

Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 160    Accepted Submission(s): 72Problem DescriptionGiven the finite multi-set A 

Problem DescriptionYou have a sequence {a1,a2,...,an} and you can delete a contiguous subsequence of length m. So what is the minimum number of inversions after the deletion. Input

Time Limit: 4000MS Memory Limit: 65536KTotal Submissions: 7918 Accepted: 2078DescriptionAfter their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their or

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1927    Accepted Submission(s): 664Problem Description　　Long long ago, there was a

DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the seque

DescriptionThere is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 605    Accepted Submission(s): 127Problem DescriptionIt's really a simple problem.

DescriptionThe 3rd round of COCI is already here! In order to bet on predict the scores, we have assumed the following: If contestant A scored strictly more points than contestant B in each o

There are N seaside villages on X island, numbered from 1 to N. N roads are built to connect all of them, which are also numbered from 1 to N, and the road with number i connects the village i and

Problem DescriptionOne day Sophia finds a very big square. There are n trees in the square. They are all so tall. Sophia is very interesting in them.She finds that trees maybe disharmony and

DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <

DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows an

My Tags  (Edit) Source : HCPC 2005 Spring Time limit : 2 sec Memory limit : 32 MSubmitted : 2946, Accepted : 672Jerry是一家公司销售部门的经理。

DescriptionSeiji Hayashi had been a professor of the Nisshinkan Samurai School in the domain of Aizu for a long time in the 18th century. In order to reward him for his meritorious career in educa

Problem DescriptionN个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a  Input每个测试实例第一行为一个整数N,(N 当N = 0，输入结束。 Output每个测试实例输出一行，包括N个整数，第I个数代表第I个气球总共被涂色的次数。 Sample Inpu

DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 We can change the matrix in the f

Number sequenceMy Tags  (Edit) Source : SCU Programming Contest 2006 Final Time limit : 1 sec Memory limit : 64 MSubmitted : 1

DescriptionEvery year, Farmer John's N (1 <= N <= 20,000) cows attend "MooFest",a social gathering of cows from around the world. MooFest involves a variety of events including haybale stacking, f

As you are probably well aware, in Byteland it is always the military officer's main worry to order his soldiers on parade correctly. In Bitland ordering soldiers is not really such a problem. If a pl

Problem DescriptionFor the k-th number, we all should be very familiar with it. Of course,to kiki it is also simple. Now Kiki meets a very similar problem, kiki wants to design a container, the co

My Tags  (Edit) Source : mostleg Time limit : 1 sec Memory limit : 64 MSubmitted : 725, Accepted : 286As most of the ACMers, wy'

DescriptionMato同学从各路神犇以各种方式（你们懂的）收集了许多资料，这些资料一共有n份，每份有一个大小和一个编号。为了防止他人偷拷，这些资料都是加密过的，只能用Mato自己写的程序才能访问。Mato每天随机选一个区间[l,r]，他今天就看编号在此区间内的这些资料。Mato有一个习惯，他总是从文件大小从小到大看资料。他先把要看的文件按编号顺序依次拷贝出来，再用他写的排序程序给文