2011年03月_xieshimao

原创 POJ 3186 动态规划

题目链接：http://poj.org/problem?id=3186题意：给定n个数每次可以从头或者尾取出数据于是按取出来得顺序，就可以排成一个数列，假设这个数列为a1,a2,a3,a4.......an现在我们假设按照取出来的顺序有一个权值w=a1*1+a2*2+a3*3+....an*n现在需要编程求出，如何控制取数的顺序，让w的值最大思路：首先我以

2011-03-31 14:11:00 2649

Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 9916 Accepted: 4185 DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an

2011-03-28 15:51:00 5181 3

原创 POJ 1661 SPFA过的。。。感谢各种牛贴出来的数据。。。

Help JimmyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6228 Accepted: 1939 Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。 Jimmy老鼠在时刻0从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当Jimmy落到某个平台上时，游戏者

2011-03-27 17:37:00 1693

原创 POJ 1080 动态规划（LCS变种）

Human Gene FunctionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10904 Accepted: 6015 DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters,

2011-03-23 10:28:00 1181

原创 POJ 3258 二分算法

题目链接：http://poj.org/problem?id=3258 题意：有一条河流，上面原来有n个石头，FJ的cow可以从这些石头上跳过去，现在FJ想训练他的cow的跳跃能力，于是乎想移去其中的m个石头，而且他要求，去掉这m个石头后，石头与石头之间的最小值必须最大。 思路：二分答案，然后验证当前答案下最少需要移去的石头数量 my ugly code: Source Code Problem:3258

2011-03-18 13:45:00 1050 1

原创 POJ 1089 贪心算法

IntervalsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5434 Accepted: 2133 DescriptionThere is given the series of n closed intervals [ai; bi], where i=1,2,...,n. The sum of those intervals may be represented as a sum of closed pairwise no

2011-03-16 09:57:00 1240

原创 POJ 2021 BFS+大量STL。。

Relative RelativesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2806 Accepted: 1210 DescriptionToday is Ted's 100th birthda

2011-03-13 16:17:00 1428

原创 POJ 3468 线段树，OIer杨弋出的题目。。膜拜中。。。orz...

A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 17755 Accepted: 4605C

2011-03-12 20:38:00 2177

原创 POJ 3264 线段树

Balanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 16163 Accepted: 7468Case Time Limit: 2000MSDescriptionFor 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 org

2011-03-11 22:34:00 3433

原创 POJ 3697 BFS暴力

USTC campus networkTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 3316 Accepted: 1023 Description USTC campus network is a huge network. There is a bi-directional link between every pair of computers in the network. One of the computer

2011-03-10 19:02:00 1726

bingshen的专栏