POJ
薄层
努力就有收获~
展开
-
POJ-3270 Cow Sorting(贪心+置换)
Farmer John's N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Each cow has a unique "grumpiness" level in the range 1...100,000. Since grumpy cows are more likely to damage FJ's milking equipment, FJ would like to reorder the cows in line原创 2017-08-02 14:15:54 · 344 阅读 · 0 评论 -
POJ-1330 Nearest Common Ancestors(lca模板题)
In the figure, each node is labeled with an integer from {1, 2,...,16}. Node 8 is the root of the tree. Node x is an ancestor of node y if node x is in the path between the root and node y. For example, node 4 is an ancestor of node 16. Node 10 is also an原创 2017-09-15 12:55:14 · 319 阅读 · 1 评论 -
POJ-1651 Multiplication Puzzle(区间dp)
he multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to the product of the number on the card taken and the numbers on原创 2017-07-12 17:44:03 · 279 阅读 · 0 评论 -
POJ-3286 + 数位DP模板
首先,感谢这位大佬的模板 http://blog.csdn.net/wust_zzwh/article/details/52100392第一个自己yy出来的数位DP,记录一下,而且考虑前导零的影响完全是自己yy出来。看了看简单模板,迷糊地去做不用考虑前导零的模板题HDU-2089,自己做完之后数位DP的思想已经稍稍成型,于是又做了这个考虑前导零的题,加深了不少对数位DP的理解。贴下原创 2017-04-27 16:47:24 · 471 阅读 · 1 评论 -
POJ-1019 Number Sequence(思维题)
A single positive integer i is given. Write a program to find the digit located in the position i in the sequence of number groups S1S2...Sk. Each group Sk consists of a sequence of positive integer numbers ranging from 1 to k, written one after another.原创 2017-07-31 21:21:55 · 723 阅读 · 0 评论 -
POJ-1932 XYZZY(判正权环路+Warlshell传递闭包)
The prototypical computer adventure game, first designed by Will Crowther on the PDP-10 in the mid-1970s as an attempt at computer-refereed fantasy gaming, and expanded into a puzzle-oriented game by Don Woods at Stanford in 1976. (Woods had been one of th原创 2017-11-02 15:10:04 · 335 阅读 · 0 评论 -
POJ-1466 Girls and Boys(最大独立集)
n 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 boy. For the study reasons it is necessary to find out the maximum set sat原创 2017-07-23 19:37:03 · 437 阅读 · 0 评论 -
POJ-2689 Prime Distance(区间素数筛--经典题)
The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the question of primality. A prime number is a number that is has no proper fac原创 2017-08-04 16:31:55 · 804 阅读 · 0 评论 -
POJ 1006(中国剩余定理)
Description人生来就有三个生理周期,分别为体力、感情和智力周期,它们的周期长度为23天、28天和33天。每一个周期中有一天是高峰。在高峰这天,人会在相应的方面表现出色。例如,智力周期的高峰,人会思维敏捷,精力容易高度集中。因为三个周期的周长不同,所以通常三个周期的高峰不会落在同一天。对于每个人,我们想知道何时三个高峰落在同一天。对于每个周期,我们会给出从当前年份的第一天开始,到出转载 2016-11-04 20:30:39 · 563 阅读 · 0 评论 -
POJ-2823 && POJ-3250 (单调队列 && 单调栈)
poj-2823: 求n个数序列中的所有段长度为k的区间内的最大值和最小值。poj-3250: 求n个数序列中每个位置的右边的数小于其数值的个数,并且中间不能有大于等于它的数。poj-2823 下面这份代码只能在c++编译器下才能过,其它编译器超时,其实只需要在出队的时候加个二分优化就能过,但懒得改了,主要是学单调队列的做法。#include using namespace原创 2017-10-11 12:01:52 · 267 阅读 · 0 评论 -
POJ-1201 (差分约束系统)
差分约束系统其实就是将不等式组的求解问题转化为最短路进行求解,所以属于图论。但往往抽象出不等式组是不容易的。差分约束系统入门可看这位大佬的博文:夜深人静写算法(四)本题大意:n个区间,输入n行ai,bi,ci,代表在区间[ai, bi]上至少要选择ci个整数点,可以在区间内任意取ci个不重复的点。求包括所有区间的区间内至少要取多少个整数点。思路:用d[i]表示从0到i至少要原创 2017-06-06 23:44:49 · 802 阅读 · 0 评论 -
POJ-1698 Alice's Chance(最大流)
Alice, a charming girl, have been dreaming of being a movie star for long. Her chances will come now, for several filmmaking companies invite her to play the chief role in their new films. Unfortunately, all these companies will start making the films at t原创 2017-07-19 18:42:15 · 347 阅读 · 0 评论 -
POJ-2449 Remmarguts' Date(A*算法+SPFA求第K短路)
"Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching his little ducks' head, he told them a story. "Prince Remmarguts lives in his kingdom UDF – United Delta of Freedom. One day their neighboring coun原创 2017-07-12 00:25:16 · 583 阅读 · 0 评论 -
POJ-2976 Dropping tests(01分数规划入门)
In 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 integer k, determine how high you can make your cumulative average if you are allowe原创 2017-09-07 12:08:21 · 437 阅读 · 0 评论 -
POJ-3264 Balanced Lineup(rmq模板题)
For 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. To keep things simple, he will take a contiguous range of cows from the原创 2017-09-15 13:06:22 · 266 阅读 · 0 评论 -
POJ 2528(线段树+离散化)
题意:n(n求出最后还能看见多少张海报。(题意是我抄的...)思路:能够想到用线段树去进行区间更新,求最终的更新结果。但发现给的数据会得到1000万,所以普通的线段树是开不了的,但是发现n的范围为1万,可以在这上面做点文章,所以可以对这给定的n个区间进行离散化。普通离散化的具体步骤为:对所有输入的数排序,然后进行去重,然后将数映射到1~n。但是普通离散化在本题中是不可行的,原创 2017-05-21 15:32:23 · 359 阅读 · 0 评论 -
POJ-1637 Sightseeing tour(通过网络流判定混合图的欧拉回路)
The city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so that tourists can see every corner of the beautiful city. They want to construct the tour so that every street in the city is visited exactly once. The bus should als原创 2017-08-02 19:31:34 · 429 阅读 · 0 评论 -
最小点覆盖集之例题
POJ-3041 Asteroids题意:给一个N*N的矩阵,一些星球位于一些点上,要求消除所有星球,每次操作可消除一行或一列的星球,求最少要几次。思路:以行和列为点,星球所在行和列的关系建边,建完图之后就会发现求最小点覆盖集。代码1:#include #include using namespace std;const int maxn = 505;int G原创 2017-07-26 20:44:54 · 1511 阅读 · 0 评论 -
POJ-2135 Farm Tour(费用流)
When FJ's friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of which contains the big barn. A total M (1 <= M <= 10000) paths that conn原创 2017-07-24 14:12:58 · 280 阅读 · 0 评论 -
POJ-1149 PIGS(最大流)
Mirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each of them has keys to some pig-houses and wants to buy a certain number of原创 2017-07-22 14:16:24 · 313 阅读 · 0 评论 -
POJ-3683 Priest John's Busiest Day(2-SAT问题)
John is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the couple who get married on that day will be forever blessed by the God of Love. This year N couples plan to get marrie原创 2017-07-17 13:42:46 · 279 阅读 · 0 评论 -
POJ-3255 Roadblocks(次短路)
Bessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She has decided to take the second-shortest rather than the原创 2017-07-13 23:45:36 · 604 阅读 · 0 评论 -
POJ-3352 Road Construction(边双连通分量+缩点)
It's almost summer time, and that means that it's almost summer construction time! This year, the good people who are in charge of the roads on the tropical island paradise of Remote Island would like to repair and upgrade the various roads that lead betwe原创 2017-08-05 16:33:32 · 410 阅读 · 0 评论