POJ
文章平均质量分 84
STILLxjy
不要让任何人打乱你生活的节奏
展开
-
(POJ3414)Pots <BFS, 记录路径>
Pots DescriptionYou are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap; DROP(i)原创 2016-11-21 19:03:50 · 536 阅读 · 0 评论 -
(POJ2777)Count Color <经典:线段树区间修改 + 或运算记颜色数>
Count Color DescriptionChosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. There is a very long board with len原创 2016-12-09 16:43:57 · 990 阅读 · 0 评论 -
(POJ2828)Buy Tickets <树状数组 | 线段树> 找第k空位
Buy Tickets DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year was approaching, but unluckily the Lit原创 2016-12-09 13:45:04 · 974 阅读 · 0 评论 -
(POJ2886)Who Gets the Most Candies? <线段树模拟约瑟夫问题,找第k个人>
Who Gets the Most Candies? DescriptionN children are sitting in a circle to play a game.The children are numbered from 1 to N in clockwise order. Each of them has a card with a non-zero integer on it原创 2016-12-09 21:37:23 · 556 阅读 · 0 评论 -
(POJ2750)Potted Flower <环形最大连续子段和 线段树单点更新>
Potted Flower DescriptionThe little cat takes over the management of a new park. There is a large circular statue in the center of the park, surrounded by N pots of flowers. Each potted flower will be原创 2016-12-18 11:11:31 · 1200 阅读 · 0 评论 -
(POJ1129)Channel Allocation <涂色问题问最少颜色数 剪枝搜索 > || <四色定律>
Channel Allocation DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels原创 2016-12-19 12:03:09 · 1190 阅读 · 0 评论 -
(POJ2676)Sudoku <简单数独问题>
Sudoku DescriptionSudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits fro原创 2016-12-19 14:05:01 · 916 阅读 · 0 评论 -
(POJ 3411)Paid Roads <DFS>
Paid Roads DescriptionA network of m roads connects N cities (numbered from 1 to N). There may be more than one road connecting one city with another. Some of the roads are paid. There are two ways to原创 2017-01-04 13:15:56 · 863 阅读 · 0 评论 -
(POJ 1724)ROADS <DFS + 简单剪枝>
ROADS DescriptionN cities named with numbers 1 … N are connected with one-way roads. Each road has two parameters associated with it : the road length and the toll that needs to be paid for the road (原创 2017-01-04 14:13:34 · 502 阅读 · 0 评论 -
(POJ1850)Code <组合数学,杨辉三角计算每一个组合数nCm>
Code DescriptionTransmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system is that one where a number is asso原创 2016-11-25 17:09:44 · 1201 阅读 · 0 评论 -
(POJ1376)Cash Machine <多重背包问题变形,二进制优化>
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原创 2016-11-25 14:49:25 · 566 阅读 · 0 评论 -
(POJ1080)Human Gene Functions <DP,最长公共子序列变形>
Human Gene Functions 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, A, C, G, and T. Biologists原创 2016-11-25 13:00:06 · 415 阅读 · 0 评论 -
(POJ2531)Network Saboteur <枚举+状态压缩 || DFS+剪枝>
Network Saboteur DescriptionA university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetw原创 2016-11-21 21:18:34 · 516 阅读 · 0 评论 -
(POJ2352)Stars <静态二叉检索树 入门题>
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原创 2016-12-05 12:07:34 · 958 阅读 · 1 评论 -
(POJ3321)Apple Tree <dfs序列 树状数组>
Apple Tree DescriptionThere is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple原创 2016-12-05 15:41:17 · 417 阅读 · 0 评论 -
(POJ1837)Balance <01背包变形经典题>
Balance DescriptionGigel has a strange “balance” and he wants to poise it. Actually, the device is different from any other ordinary balance. It orders two arms of negligible weight and each arm’s l原创 2016-11-23 14:04:38 · 773 阅读 · 0 评论 -
(POJ3267)The Cow Lexicon <DP>
The Cow Lexicon DescriptionFew know that the cows have their own dictionary with W (1 ≤ W ≤ 600) words, each containing no more 25 of the characters ‘a’..’z’. Their cowmunication system, based on mooi原创 2016-11-23 15:53:09 · 373 阅读 · 0 评论 -
(POJ3176) Cow Bowling <简单dp>
Cow Bowling DescriptionThe cows don’t use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this原创 2016-11-23 16:34:20 · 346 阅读 · 0 评论 -
(POJ1836)Alignment <DP,最长上升子序列变形>
Alignment DescriptionIn the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of the captain. The captain is not satisfied原创 2016-11-24 16:02:24 · 445 阅读 · 1 评论 -
(POJ1195)Mobile phones <二维树状数组>
Mobile phones DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with t原创 2016-12-07 11:04:04 · 500 阅读 · 0 评论 -
(POJ 1691)Painting A Board <top序列 + DFS>
Painting A Board DescriptionThe CE digital company has built an Automatic Painting Machine (APM) to paint a flat board fully covered by adjacent non-overlapping rectangles of different sizes each with原创 2017-01-04 17:01:40 · 485 阅读 · 0 评论 -
(POJ 1191)棋盘分割 <DFS>
棋盘分割 Description将一个8*8的棋盘进行如下分割:将原棋盘割下一块矩形棋盘并使剩下部分也是矩形,再将剩下的部分继续如此分割,这样割了(n-1)次后,连同最后剩下的矩形棋盘共有n块矩形棋盘。(每次切割都只能沿着棋盘格子的边进行) Input第1行为一个整数n(1 < n < 15)。 第2行至第9行每行为8个小于100的非负整数,表示棋盘上相应格子的分值。每行相邻两数之原创 2017-01-04 20:50:01 · 430 阅读 · 0 评论 -
(POJ 1159)Palindrome <最长公共子序列 / 滚动数组优化 / 记忆化搜索> 简单回文数
Palindrome 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, deter原创 2017-01-05 11:02:59 · 652 阅读 · 0 评论 -
(POJ 1655 Balancing Act)树型DP + 删点
Balancing Act Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13137 Accepted: 5548 DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1…N. Deleting any node原创 2017-03-15 22:19:29 · 435 阅读 · 0 评论 -
(POJ 2378 Tree Cutting)树型DP + 删点
Tree Cutting Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4512 Accepted: 2754 DescriptionAfter Farmer John realized that Bessie had installed a “tree-shaped” network among his原创 2017-03-15 22:21:03 · 521 阅读 · 0 评论 -
(POJ 2299)Ultra-QuickSort 树状数组求逆序对数 + 离散化
Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 60461 Accepted: 22417 DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algor原创 2017-04-28 20:26:35 · 458 阅读 · 0 评论 -
(POJ 2481)Cows 树状数组
Cows Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 18570 Accepted: 6246 DescriptionFarmer John’s cows have discovered that the clover growing along the ridge of the hill (wh原创 2017-04-29 19:39:34 · 481 阅读 · 0 评论 -
(POJ 3067)Japan 树状数组
Japan Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 27518 Accepted: 7447 DescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must be built for the原创 2017-04-29 20:44:45 · 511 阅读 · 0 评论 -
(POJ 2186)Popular Cows 强连通分量 + 缩点图
Popular CowsTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 33190 Accepted: 13517 DescriptionEvery cow’s dream is to become the most popular cow in the herd. In a herd of N (1原创 2017-04-19 20:18:56 · 498 阅读 · 0 评论 -
(POJ 2155)Matrix (复习必看题)经典二维树状数组题目 + 树状数组的论文讲解
Matrix Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 27332 Accepted: 9994 DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the原创 2017-05-02 19:03:52 · 499 阅读 · 1 评论 -
(POJ 3352)无向图的边双连通分量模板题 + 在一个图中最少加几条边可以使得图边双连通
Road Construction Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 11779 Accepted: 5899 DescriptionIt’s almost summer time, and that means that it’s almost summer construction原创 2017-04-20 20:07:01 · 1445 阅读 · 0 评论 -
(POJ 3140 Contestants Division)树型DP + 删边
Contestants Division Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 9909 Accepted: 2821 DescriptionIn the new ACM-ICPC Regional Contest, a special monitoring and submitting syst原创 2017-03-15 22:17:38 · 465 阅读 · 0 评论 -
(POJ 3107 Godfather)树型DP + 删点
Godfather Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6646 Accepted: 2338 DescriptionLast years Chicago was full of gangster fights and strange murders. The chief of the poli原创 2017-03-15 22:16:07 · 404 阅读 · 0 评论 -
(POJ 1054)The Troublesome Frog <暴力枚举+剪枝 || DP>
题目链接:http://poj.org/problem?id=1054题意: 给定一个行数和列数固定的网格,再给定若干个点,这些点是使用矩形上网格线交叉点的坐标来唯一确定的R行C列的网格,左上角的坐标为(1,1)右下角的坐标为(R,C),问给定的这些点能够组成最长可能路径是多长. 路径的定义的如下的:由若干连续且间隔相等的点组成,方向可任意,起始点和结束点均在网格之外的任意空间.也就是只要满足网格原创 2017-01-17 20:13:48 · 699 阅读 · 0 评论 -
(POJ 3280)Cheapest Palindrome <DP> 回文数变形
Cheapest Palindrome DescriptionKeeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the syste原创 2017-01-05 11:17:22 · 541 阅读 · 0 评论 -
(POJ 3254)Corn Fields <状态压缩DP 好题>
Corn Fields DescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of原创 2017-01-05 16:43:03 · 484 阅读 · 0 评论 -
(POJ 1185)炮兵阵地 <状压DP经典题目>
炮兵阵地 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用”H” 表示),也可能是平原(用”P”表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示: 如果在地图中的灰色所标识的平原上部署一支炮兵部队,则图中的黑色的网格表示它能够攻击到的区原创 2017-01-06 15:04:44 · 644 阅读 · 0 评论 -
(POJ1201)Intervals <差分约束系统-区间约束>
Intervals DescriptionYou are given n closed, integer intervals [ai, bi] and n integers c1, …, cn. Write a program that: reads the number of intervals, their end points and integers c1, …, cn from原创 2016-12-02 12:44:07 · 1319 阅读 · 0 评论 -
(POJ 1947)Rebuilding Roads <树型DP>
Rebuilding Roads DescriptionThe cows have reconstructed Farmer John’s farm, with its N barns (1 <= N <= 150, number 1..N) after the terrible earthquake last May. The cows didn’t have time to rebuild a原创 2017-01-10 19:26:58 · 366 阅读 · 0 评论 -
(POJ 1753)Flip Game <状压+BFS>
Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 42341 Accepted: 18250 DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each原创 2017-01-12 19:02:31 · 437 阅读 · 0 评论