原创 hdu 4911Inversion
Description bobo has a sequence a 1,a 2,…,a n. He is allowed to swap two adjacent numbers for no more than k times.
原创 hdu 1203
Description Speakless很早就想出國,現在他已經考完了所有需要的考試,準備了所有要準備的材料,於是,便需要去申請學校了。要申請國外的任何大學,你都要交納一定的申請費用,這可是很驚人的。Speakless沒有多少錢,
原创 codeforece 18c
Description Once Bob took a paper stripe of n squares (the height of the stripe is 1 square). In each square he wrote
原创 Codeforces Round #178 (Div. 2) B .Shaass and Bookshelf
Shaass has n books. He wants to make a bookshelf for all his books. He wants the bookshelf's dimensions to be as small
原创 codeforce492 B. Vanya and Lanterns
B. Vanya and Lanterns time limit per test 1 second memory limit per test 256 megabytes input standard input output st
原创 猴子喫香蕉
Description 一組研究人員正在設計一項實驗,以測試猴子的智商。他們將掛香蕉在建築物的屋頂,同時,提供一些磚塊給這些猴子。如果猴子足夠聰明,它應當能夠通過合理的放置一些磚塊建立一個塔,並爬上去喫他們最喜歡的香蕉。 研究人
原创 poj 1458
Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Gi
原创 poj 3903
Description The world financial crisis is quite a subject. Some people are more relaxed while others are quite anxiou
原创 poj 1505
Description Before the invention of book-printing, it was very hard to make a copy of a book. All the contents had to
原创 poj 2299
Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 48121 Accepted: 17553 Description In
原创 hdu 1003
Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For e
原创 uva 10382
n sprinklers are installed in a horizontal strip of grass l meters long and w meters wide. Each sprinkler is installed
原创 uva 10020
The Problem Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal am
原创 poj 1328Radar Installation
Description Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Eac
原创 hdu 2955
Description The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets c