- 博客(20)
- 收藏
- 关注
RSS订阅原创 POJ 1190 - 生日蛋糕
Description7月17日是Mr.W的生日，ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕，每层都是一个圆柱体。设从下往上数第i(1 Ri+1且Hi > Hi+1。 由于要在蛋糕上抹奶油，为尽可能节约经费，我们希望蛋糕外表面（最下一层的下底面除外）的面积Q最小。 令Q = Sπ 请编程对给出的N和M，找出蛋糕的制作方案（适当的Ri和Hi的值），使S最小。
2016-09-28 20:25:38
448
原创 HDU 5904 - LCIS
Problem DescriptionAlex has two sequences a1,a2,...,an and b1,b2,...,bm. He wants find a longest common subsequence that consists of consecutive values in increasing order.InputThere are mul
2016-09-28 19:38:43
436
原创 BC#87
1001#include #include using namespace std;const int maxn = 500 + 10;int a[maxn];int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b);}int main(){ int t; scanf("%d", &t)
2016-09-24 20:59:20
256
原创 HDU 5878 - I Count Two Three
Problem DescriptionI will show you the most popular board game in the Shanghai Ingress Resistance Team.It all started several months ago.We found out the home address of the enlightened agent Ic
2016-09-24 15:25:46
342
原创 HDU 5883 - The Best Path
Problem DescriptionAlice is planning her travel route in a beautiful valley. In this valley, there are N lakes, and M rivers linking these lakes. Alice wants to start her trip from one lake, and enj
2016-09-23 19:33:53
339
原创 HDU 5877 - Weak Pair
Problem DescriptionYou are given a rooted tree of N nodes, labeled from 1 to N. To the ith node a non-negative value ai is assigned.An ordered pair of nodes (u,v) is said to be weak if (1) u is a
2016-09-22 20:14:12
385
原创 HDU 5875 - Function
Problem DescriptionThe shorter, the simpler. With this problem, you should be convinced of this truth. You are given an array A of N postive integers, and M queries in the form (l,r). A funct
2016-09-19 19:03:33
538
原创 HDU 5872 - Seats
Problem DescriptionThe yearly sports meeting is approaching in Hail university and M departments, conveniently numbered from 1 to M, are going to take part in. Each department has no more than h stu
2016-09-18 19:05:05
628
原创 HDU 5879 - Cure【2016 ACM 区域赛青岛赛区网络赛】
Problem DescriptionGiven an integer n, we only want to know the sum of 1/k2 where k from 1 to n.InputThere are multiple cases.For each test case, there is a single line, containing a singl
2016-09-18 18:57:17
793
原创 HDU 5874 - Friends ans Enemis
Problem DescriptionOn an isolated island, lived some dwarves. A king (not a dwarf) ruled the island and the seas nearby, there are abundant cobblestones of varying colors on the island. Every two dw
2016-09-13 15:17:31
416
原创 HDU 5873 - Football Match【2016大连区域赛网络赛1006】
Problem DescriptionA mysterious country will hold a football world championships---Abnormal Cup, attracting football teams and fans from all around the world. This country is so mysterious that none
2016-09-12 19:58:12
607
原创 POJ 1821 - Fence
DescriptionA team of k (1 <= K <= 100) workers should paint a fence which contains N (1 <= N <= 16 000) planks numbered from 1 to N from left to right. Each worker i (1 <= i <= K) should sit in fron
2016-09-09 17:40:05
330
原创 POJ 1442 - Black Box
DescriptionOur Black Box represents a primitive database. It can save an integer array and has a special i variable. At the initial moment Black Box is empty and i equals 0. This Black Box processes
2016-09-04 13:52:55
334
原创 POJ 1141 - Brackets Sequence
DescriptionLet us define a regular brackets sequence in the following way:1. Empty sequence is a regular sequence.2. If S is a regular sequence, then (S) and [S] are both regular sequences.3
2016-09-04 11:10:20
284
原创 POJ 1276 - Cash Machine
DescriptionA Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominatio
2016-09-03 10:29:28
258
原创 UVA 10585 - Center of Symmetry
DescriptionGiven is a set of n points with integer coordinates. Your task is to decide whether the set has a center of symmetry.A set of points S has the center of symmetry if there exists a
2016-09-03 09:19:24
470
原创 HDU 2846 - Repository
Problem DescriptionWhen you go shopping, you can search in repository for avalible merchandises by the computers and internet. First you give the search system a name about something, then the syste
2016-09-01 17:55:47
306
原创 HDU 1986 - Encoding
Problem DescriptionChip and Dale have devised an encryption method to hide their (written) text messages. They first agree secretly on two numbers that will be used as the number of rows (R) and col
2016-09-01 10:29:36
523
原创 POJ 1661 - Help Jimmy
Description"Help Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。Jimmy老鼠在时刻0从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当Jimmy落到某个平台上时，游戏者选择让它向左还是向右跑，它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时，开始继续下落。Jimm
2016-09-01 08:57:26
282
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人