POJ
文章平均质量分 75
安庆闪耀
这个作者很懒,什么都没留下…
展开
-
poj 2975 Nim(博弈)
DescriptionNim is a 2-player game featuring several piles of stones. Players alternate turns, and on his/her turn, a player’s move consists of removing one or more stones from any single pile. P原创 2016-04-25 23:12:42 · 350 阅读 · 0 评论 -
poj 1062 昂贵的聘礼(最短路)
Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币原创 2016-03-17 18:56:51 · 296 阅读 · 0 评论 -
poj 2431Expedition(优先队列+贪心)
DescriptionA group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately managed to run over a rock and puncture the truck's原创 2016-03-02 16:07:29 · 243 阅读 · 0 评论 -
poj 2127 Greatest Common Increasing Subsequence(最长公共上升子序列dp)
DescriptionYou are given two sequences of integer numbers. Write a program to determine their common increasing subsequence of maximal possible length. Sequence S1 , S2 , . . . , SN of length N原创 2016-03-01 23:51:36 · 356 阅读 · 0 评论 -
poj 3714Raid(最近点对)
RaidTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 9575 Accepted: 2919DescriptionAfter successive failures in the battles against the Union, the Empire retreated to its last str原创 2015-12-25 11:16:34 · 344 阅读 · 0 评论 -
hdu 1054 &&poj 1463 Strategic Game(树形dp)
Strategic Game时间限制1秒 内存限制10240KBProblem DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sa原创 2015-12-23 16:52:02 · 518 阅读 · 0 评论 -
poj 2395 Out of Hay(最小生成树)
Out of HayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13571 Accepted: 5251DescriptionThe cows have run out of hay, a horrible event that must be remedied immediately. Bessie原创 2015-12-23 12:42:39 · 302 阅读 · 0 评论 -
poj 1915 Knight Moves(bfs)
Knight MovesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23624 Accepted: 11099DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but h原创 2015-12-22 23:49:43 · 352 阅读 · 0 评论 -
poj 2387 Til the Cows Come Home(最短路)
Til the Cows Come HomeDescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie ne原创 2015-12-22 19:41:06 · 288 阅读 · 0 评论 -
poj 2421&&hdu 1102 Constructing Roads(最小生成树)
Constructing RoadsDescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two villag原创 2015-12-22 16:59:37 · 529 阅读 · 0 评论 -
poj 1389Area of Simple Polygons(矩形面积并)
Area of Simple PolygonsDescriptionThere are N, 1 <= N <= 1,000 rectangles in the 2-D xy-plane. The four sides of a rectangle are horizontal or vertical line segments. Rectangles are defined原创 2015-12-22 11:50:49 · 567 阅读 · 0 评论 -
poj 1469&&hdu 1803 Courses(最大匹配数)
CoursesProblem DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committ原创 2015-12-22 11:36:09 · 572 阅读 · 0 评论 -
poj 1979 &&hdu 1312Red and Black (bfs)
Red and BlackDescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one原创 2015-12-21 00:07:37 · 564 阅读 · 0 评论 -
hdu 1151 &&poj 1422 Air Raid (二分图匹配 最小路径覆盖)
Air RaidDescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking thr原创 2015-12-20 22:17:25 · 534 阅读 · 0 评论 -
poj 2976 Dropping tests(最大化平均值)
DescriptionIn a certain course, you take n tests. If you get ai out of bi questions correct on test i, your cumulative average is defined to be.Given your test scores and a positive原创 2015-12-20 21:52:36 · 573 阅读 · 0 评论 -
poj 1466 && hdu 1068Girls and Boys(最大独立集)
DescriptionIn the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically involved" is defined between one girl and one原创 2015-12-20 21:04:54 · 820 阅读 · 0 评论 -
poj 2411&&hdu 1400 Mondriaan's Dream(状压DP)
Problem DescriptionSquares and rectangles fascinated the famous Dutch painter PietMondriaan. One night, after producing the drawings in his 'toilet series'(where he had to use his toilet paper to原创 2015-12-19 21:47:22 · 418 阅读 · 0 评论 -
poj 2663 Tri Tiling(推公式)
DescriptionIn how many ways can you tile a 3xn rectangle with 2x1 dominoes? Here is a sample tiling of a 3x12 rectangle. InputInput consists of several test cases followed by a line co原创 2016-04-10 20:49:51 · 342 阅读 · 0 评论 -
poj 3169 Layout(差分约束)
DescriptionLike everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The c原创 2016-03-27 21:57:12 · 628 阅读 · 0 评论 -
poj 3468 A Simple Problem with Integers(线段树成段更新lazy)
DescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other is原创 2016-03-30 14:22:44 · 258 阅读 · 0 评论 -
poj 1159 && hdu 1513 Palindrome(LCS)
DescriptionA palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines t原创 2016-04-25 23:21:27 · 346 阅读 · 0 评论 -
hdu 1159 && POJ 1458Common Subsequence(LCS)
Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there e原创 2016-04-25 23:24:47 · 323 阅读 · 0 评论 -
hdu 2104 K-th Number(静态求区间第k小+整体二分)
K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 46551 Accepted: 15539Case Time Limit: 2000MSDescriptionYou are working for Macrohard c原创 2016-05-01 20:24:29 · 1186 阅读 · 0 评论 -
poj 1455 Crazy tea party(数学)
Crazy tea partyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7318 Accepted: 4973Descriptionn participants of > sit around the table. Each minute one p原创 2016-05-01 20:28:28 · 581 阅读 · 0 评论 -
poj 2100 Graveyard Design(尺取)
Graveyard DesignTime Limit: 10000MS Memory Limit: 64000KTotal Submissions: 5957 Accepted: 1413Case Time Limit: 2000MSDescriptionKing George has recently dec原创 2016-05-01 20:29:45 · 2832 阅读 · 0 评论 -
poj 3320 Jessica's Reading Problem(尺取)
Jessica's Reading ProblemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9760 Accepted: 3210DescriptionJessica's a very lovely girl wooed by lots of boy原创 2016-05-01 20:31:21 · 839 阅读 · 0 评论 -
poj 2739 Sum of Consecutive Prime Numbers(尺取+筛素数)
Sum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22582 Accepted: 12350DescriptionSome positive integers can be represente原创 2016-05-01 20:33:22 · 3326 阅读 · 0 评论 -
poj 3122 Pie (最大化平均值)
DescriptionMy birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my p原创 2015-12-20 22:09:14 · 643 阅读 · 0 评论 -
poj 2202 Squares(求正方形个数)
SquaresTime Limit: 3500MS Memory Limit: 65536KTotal Submissions: 18162 Accepted: 6969DescriptionA square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degre原创 2015-12-24 16:32:15 · 962 阅读 · 0 评论 -
poj 2771 Guardian of Decency(最大独立集)
Guardian of DecencyTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 5397 Accepted: 2268DescriptionFrank N. Stein is a very conservative high-school teach原创 2016-05-28 14:16:54 · 510 阅读 · 0 评论 -
poj 2541 Binary Witch(状态压缩)
Binary WitchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1521 Accepted: 558DescriptionOnce upon a time in the silent depths of digital forests there原创 2016-05-28 14:14:01 · 561 阅读 · 0 评论 -
poj 2559 Largest Rectangle in a Histogram(单调栈)
Largest Rectangle in a HistogramTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18691 Accepted: 6005DescriptionA histogram is a polygon composed of a se原创 2016-05-28 14:21:09 · 520 阅读 · 0 评论 -
poj 2299 Ultra-QuickSort(求逆序对)
DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the seque原创 2016-04-10 20:46:27 · 440 阅读 · 0 评论 -
poj 1804 Brainman(求逆序对)
DescriptionBackground Raymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246 toothpicks spilled all over the floor in an instant just by glancing at them. And he can even c原创 2016-04-10 20:45:16 · 951 阅读 · 0 评论 -
poj 3067 Japan(求逆序对)
DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the venue. Japan is tall island with N cities on the East coast and M cities on the West coast (M <原创 2016-04-10 20:43:57 · 401 阅读 · 0 评论 -
poj 1042 Gone Fishing(贪心)
DescriptionJohn is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at lak原创 2016-04-10 20:41:12 · 510 阅读 · 0 评论 -
poj 3264 Balanced Lineup(ST)
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 cows.原创 2016-04-10 20:38:29 · 403 阅读 · 0 评论 -
poj 3186 Treats for the Cows(区间dp)
DescriptionFJ has purchased N (1 The treats are interesting for many reasons:The treats are numbered 1..N and stored sequentially in single file in a long box that is open at both ends. On原创 2016-04-23 09:25:22 · 334 阅读 · 0 评论