2015年04月_sunny1996

原创 POJ3061 Subsequence (追逐法)

DescriptionA sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal

2015-04-26 22:22:13 532

原创 POJ2352 Stars（线段树进阶）

DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that ar

2015-04-25 20:40:34 374

原创 POJ3264 Balanced Lineup（线段树入门）

DescriptionFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the co

2015-04-24 22:18:55 305

原创 POJ3104 Drying (二分的力量2)

DescriptionIt is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not afraid of this boring process. Jane has decided to use a radiator to m

2015-04-12 21:52:41 971

原创 POJ2484 A Funny Game (典型博弈论)

DescriptionAlice and Bob decide to play a funny game. At the beginning of the game they pick n(1 6) coins in a circle, as Figure 1 shows. A move consists in removing one or two adjacent coins,

2015-04-12 18:15:45 620

原创 POJ3984 迷宫问题 (BFS与路径记录)

Description定义一个二维数组： int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的

2015-04-12 18:05:11 466

原创 POJ2785 4 Values whose Sum is 0（二分的力量）

DescriptionThe SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b + c + d = 0

2015-04-10 22:43:14 918

原创 POJ2225 Asteroids! (三维的BFS求最短路)

Asteroids!Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3017 Accepted: 1138DescriptionYou're in space. You want to get home. There are asteroids

2015-04-04 23:46:50 480

ChenYitian