JokerPoker的专栏

Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1238 Accepted: 483 Description We have a map for farming land in a country. The whole farming land of the country is divided into a

Description In order to lower the risk of riots and escape attempts, the boards of two nearby prisons of equal prisoner capacity, have decided to rearrange their prisoners among themselves. They want

Description Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and v. Give an integer k,for every pair (u,v) of verti

Description A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "car", "carb", "carbo", and "carbon". Note that the empty string

Description Bessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the title 'Miss Cow World'. As a result, Bessie will make a tour of N (2 <= N <= 50,000) farms

Description A friend of yours has taken the job of security officer at the Star-Buy Company, a famous depart- ment store. One of his tasks is to install a video surveillance system to guarantee the se

Description This year, ACM/ICPC World finals will be held in a hall in form of a simple polygon. The coaches and spectators are seated along the edges of the polygon. We want to place a rotating scor

http://poj.org/problem?id=1442 题目又臭又长就不贴了，给两串数a[i],u[i]长度分别为M,N（我读入的时候是N,M。习惯了。。。）。对于每个u[i]，输出a数组前u[i]个中从小到大的第i个数。 //=================================================================================

Description Consider a tree with N vertices, numbered from 1 to N. Add, if it is possible, a minimum number of edges thus every vertex belongs to exactly one cycle. Input The input has the following s

Description It's well known that DNA Sequence is a sequence only contains A, C, T and G, and it's very useful to analyze a segment of DNA Sequence，For example, if a animal's DNA sequence contains se

http://poj.org/problem?id=1436 题目大意： 1.给出n条垂直x轴的线段。 2.定义两条线段水平可见当且仅当存在一条平行于x轴的线段，它的两个端点落在这两条线段上并且不与第三条线段相交。 3.定义三条线段构成一个三角形当且仅当这三条线短两两之间水平可见。 求这n条线段可以构成多少个三角形。 //====================================

Description As an employee of the Macrohard Company, you have been asked to implement the new data structure that would be used to store some integer keys.  The keys must be stored in a special ordere

Description The art galleries of the new and very futuristic building of the Center for Balkan Cooperation have the form of polygons (not necessarily convex). When a big exhibition is organized, watch