POJ
文章平均质量分 73
sxk_sxy
努力用自己辛勤的汗水,成为一名真正的ACMer
展开
-
POJ 2029 Get Many Persimmon Trees (二维树状数组)
C - Get Many Persimmon TreesTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2029DescriptionSeiji Hayashi had been a professo原创 2014-10-03 13:53:46 · 1206 阅读 · 0 评论 -
POJ 3984 迷宫问题 (BFS)
POJ 3984 迷宫问题题意:原创 2014-07-22 23:20:02 · 867 阅读 · 0 评论 -
POJ 2778 DNA Sequence (AC自动机 + 矩阵快速幂)
题目链接:DNA Sequence解析:AC自动机 + 矩阵加速(快速幂)。这个时候AC自动机 的一种状态转移图的思路就很透彻了,AC自动机就是可以确定状态的转移。AC代码:#include #include #include #include using namespace std;const int MOD = 100000;str原创 2015-08-09 18:23:19 · 982 阅读 · 0 评论 -
POJ 1042 Gone Fishing (贪心)(刘汝佳黑书)
Gone FishingTime Limit: 2000MS Memory Limit: 32768KTotal Submissions: 30281 Accepted: 9124DescriptionJohn is going on a fishing trip. He has h hours available (原创 2015-06-11 09:51:46 · 2798 阅读 · 0 评论 -
POJ 2533 Longest Ordered Subsequence (LIS)
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 35930 Accepted: 15779DescriptionA numeric sequence of ai is ordered if a1原创 2015-03-02 20:11:56 · 598 阅读 · 0 评论 -
POJ 2431 Expedition (贪心 + 优先级队列)
ExpeditionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7696 Accepted: 2260DescriptionA group of cows grabbed a truck and ventured on an expeditio原创 2015-01-24 12:06:18 · 1543 阅读 · 0 评论 -
POJ 3617 Best Cow Line (贪心)
Best Cow LineTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11230 Accepted: 3329DescriptionFJ is about to take his N (1 ≤ N ≤ 2,000) cows to the an原创 2015-01-22 11:10:07 · 828 阅读 · 0 评论 -
POJ 3069 Saruman's Army (贪心)
Saruman's ArmyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4487 Accepted: 2314DescriptionSaruman the White must lead his army along a straight原创 2015-01-22 12:22:45 · 801 阅读 · 0 评论 -
POJ 3253 Fence Repair (贪心 + Huffman树)
Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 28155 Accepted: 9146DescriptionFarmer John wants to repair a small length of the fence a原创 2015-01-22 13:51:42 · 886 阅读 · 0 评论 -
POJ 3414 Pots (DFS || BFS)
题目链接:Pots解析:给定两个水瓶的大小a和b,以及目标c,输出最短操作使某一水瓶中剩下c容量的水。操作包括倒空、倒满、两瓶互相倒。解法一:DFS枚举每次可行的方案,并对枚举的上限做了限制,即如果当前的枚举次数已经大于目前最小次数解就剪枝。AC代码:#include #include #include using namespace std;原创 2015-08-24 13:00:18 · 697 阅读 · 0 评论 -
POJ 3087 Shuffle'm Up (DFS)
题目链接:Shuffle'm Up题意:有a和b两个长度为n的字符序列,现定义操作:将a、b的字符交叉合并到一个序列c,再将c最上面的n个归为a,最下面n个归为b给出a,b和目标序列c,问最少多少次操作a、b转化为c解析:将a、b放入哈希表,然后模拟操作过程直接dfs即可。AC代码:#include #include #include原创 2015-08-25 21:36:58 · 734 阅读 · 0 评论 -
POJ 3279 Fliptile
题目链接:Fliptile解析:先确定第一行的翻转方式,然后再判断是否存在解以及解的最小步数是多少。然后将第一行的所有翻转方式枚举一遍即可求出最优解。枚举的时候可以用整数表示集合。AC代码:#include #include #include #include using namespace std;const int dx[5] =原创 2015-08-21 13:29:34 · 602 阅读 · 0 评论 -
HDU 1043 && POJ 1077 Eight (A*)
题目链接:HDU 1043 POJ 1077解析:A*算法搜索中选择路径的条件:f = g + hg:搜索深度h:当前状态所有格点与目标状态对应格点曼哈顿距离。(曼哈顿距离:横纵坐标差值的绝对值之和)中间还有一个剪枝:只有起始状态和目标状态的奇偶性相同时,才有解,否则,直接输出无解。AC代码:#inc原创 2015-09-07 13:08:18 · 599 阅读 · 0 评论 -
POJ 2251 Dungeon Master (BFS)
题目链接:Dungeon Master解析:三维BFS模板题。6个方向开始想的太复杂了,水了好久,其实只要老老实照二维的套就完了。AC代码:#include #include #include #include #include using namespace std;int L, R, C;string m[32][32];bool原创 2015-08-19 19:31:31 · 509 阅读 · 0 评论 -
POJ 1321 棋盘问题 (DFS)
题目链接:棋盘问题解析:dfs暴力从上到下、从左到右搜索。AC代码://代码1#include #include #include using namespace std;int n, k, ans;char maze[10][10];bool vis[10][10];void dfs(int x, int y, int step){原创 2015-08-19 15:14:18 · 671 阅读 · 0 评论 -
POJ 3278 Catch That Cow (BFS)
题目链接:Catch That Cow解析:两个数n和k,三种操作:+1、-1、*2,问n最少经过多少次操作能和k相等。最简单的bfs模板了,注意+1的条件:x+1 -1的条件:x-1 >= 0*2的条件:x AC代码:#include #include #include #include #include using name原创 2015-08-19 11:52:07 · 591 阅读 · 0 评论 -
POJ 1625 Censored! (AC自动机 + 高精度 + DP)
题目链接:Censored!解析:AC自动机 + 高精度 + 简单DP。字符有可能会超过128,用map映射一下即可。中间的数太大,得上高精度。用矩阵快速幂会超时,简单的DP就能解决时间的问题。AC代码:#include #include #include #include #include #include using name原创 2015-08-13 22:50:51 · 726 阅读 · 0 评论 -
POJ 1083 && HDU 1050 Moving Tables (贪心)
Moving TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20302 Accepted Submission(s): 6889Problem DescriptionThe famou原创 2014-11-15 00:52:29 · 1563 阅读 · 0 评论 -
POJ 3126 Prime Path (BFS)
题目链接:Prime Path解析:两个长度为4的数字s和e,操作定义为:每步只能改变一位数字,并且改变后的数字必须为素数。问s最少经历多少次操作能变成e。先预处理筛出10000以内的素数每次操作可以对4个数字中的一个操作对于每个数字有10种可能性AC代码:#include #include #include #include #in原创 2015-08-25 09:55:49 · 591 阅读 · 0 评论 -
POJ 2406 Power Strings (KMP next数组应用)
解决这道题的关键,shi学这个定理原创 2014-06-10 15:57:29 · 687 阅读 · 0 评论 -
POJ 2386 Lake Counting (dfs)
Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19843 Accepted: 9980DescriptionDue to recent rains, water has pooled in various places in原创 2014-07-23 16:40:15 · 675 阅读 · 0 评论 -
POJ 2155 Matrix (二维树状数组)
MatrixTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number原创 2014-07-28 08:33:31 · 936 阅读 · 0 评论 -
hdu 2084 & POJ 1163 数塔 (dp)
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24626 Accepted Submission(s): 14814Problem Description在讲述DP算法的时候,一个经典的例子就原创 2015-01-30 20:18:35 · 796 阅读 · 0 评论 -
POJ 3169 Layout (差分约束系统 + Bellman-ford算法)
LayoutTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7613 Accepted: 3658DescriptionLike everyone else, cows like to stand close to their friends wh原创 2015-01-29 21:44:27 · 1754 阅读 · 2 评论 -
POJ 2299 Ultra-QuickSort (树状数组求逆序数+离散化)
Ultra-QuickSortTime Limit:7000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2299DescriptionIn this problem, you have to analyze a part原创 2014-07-31 23:40:30 · 840 阅读 · 0 评论 -
POJ 3723 Conscription (最大权森林 + Kruskal算法)
ConscriptionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8317 Accepted: 2887DescriptionWindy has a country, and he wants to build an army to protec原创 2015-01-29 16:22:36 · 961 阅读 · 0 评论 -
POJ 3255 Roadblocks (次短路径 + Dijkstra算法)
RoadblocksTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7982 Accepted: 2921DescriptionBessie has moved to a small farm and sometimes enjoys return原创 2015-01-29 12:15:02 · 1706 阅读 · 0 评论 -
POJ 1182 食物链 (种类并查集)
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 47729 Accepted: 13895Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每原创 2015-01-24 15:53:01 · 809 阅读 · 0 评论 -
POJ 2823 Sliding Window
Sliding WindowTime Limit: 12000MS Memory Limit: 65536KTotal Submissions: 40956 Accepted: 12150Case Time Limit: 5000MSDescriptionAn array of size n ≤ 106原创 2015-01-07 00:18:35 · 871 阅读 · 0 评论 -
POJ 1308 Is It A Tree? (并查集)
Is It A Tree?Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23006 Accepted: 7898DescriptionA tree is a well-known data structure that is either emp原创 2015-01-31 17:25:49 · 862 阅读 · 0 评论 -
POJ题目分类
转自:Kuangbin的博客初期:一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. (4)递推. (5)构造法.(poj3295) (6)模拟法.(poj1068,poj2632,poj1573,poj2993,转载 2015-01-14 15:24:08 · 844 阅读 · 0 评论 -
POJ 3615 Cow Hurdles (Floyd算法)
Cow HurdlesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6142 Accepted: 2752DescriptionFarmer John wants the cows to prepare for the county jumpin原创 2015-01-14 23:51:47 · 1336 阅读 · 0 评论 -
POJ 3009 Curling 2.0 (dfs)
Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12700 Accepted: 5343DescriptionOn Planet MM-21, after their Olympic games this year, curl原创 2015-02-03 21:14:07 · 774 阅读 · 0 评论 -
POJ 2253 Frogger (dijkstra算法 + 预处理)
FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 27020 Accepted: 8797DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Sud原创 2015-01-16 15:18:37 · 3172 阅读 · 0 评论 -
POJ 3259 Wormholes (bellman_ford算法判负环)
WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 32393 Accepted: 11771DescriptionWhile exploring his many farms, Farmer John has discovered原创 2015-01-16 12:00:36 · 1415 阅读 · 0 评论 -
POJ 1852 Ants (思维技巧 + 贪心)
AntsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 10639 Accepted: 4718DescriptionAn army of ants walk on a horizontal pole of length l cm, each wi原创 2015-02-02 11:18:57 · 1791 阅读 · 0 评论 -
POJ 1502 MPI Maelstrom (Dijkstra算法+输入处理)
MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5712 Accepted: 3553DescriptionBIT has recently taken delivery of their new supercompute原创 2015-01-14 13:25:35 · 2174 阅读 · 0 评论 -
POJ 1979 Red and Black (DFS)
Red and BlackTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23904 Accepted: 12927DescriptionThere is a rectangular room, covered with square tiles.原创 2015-02-02 16:45:06 · 812 阅读 · 0 评论 -
POJ 3669 Meteor Shower (BFS + 预处理)
Meteor ShowerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9677 Accepted: 2718DescriptionBessie hears that an extraordinary meteor shower is comin原创 2015-02-02 21:13:02 · 1360 阅读 · 0 评论 -
POJ 1426 Find The Multiple (DFS / BFS)
题目链接:Find The Multiple解析:直接从前往后搜,设当前数为k用long long保存,则下一个数不是k*10就是k*10+1AC代码:#include #include #include #include using namespace std;long long n;int DEEP;bool flag;void dfs(原创 2015-08-19 20:29:06 · 581 阅读 · 0 评论