
POJ
文章平均质量分 85
「已注销」
这个作者很懒,什么都没留下…
展开
-
POJ1002_487-3279(快速排序)
487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 227719 Accepted: 39710DescriptionBusinesses like to have memorable telephone numbers. One way to原创 2014-01-06 15:48:37 · 933 阅读 · 0 评论 -
POJ3094_Quicksum
QuicksumTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述A checksum is an algorithm that scans a packet of data and returns a single number. The idea is that if the packet is原创 2014-01-12 17:37:24 · 586 阅读 · 0 评论 -
POJ1007_DNA Sorting(选择排序)
DNA SortingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 77545 Accepted: 31097DescriptionOne measure of ``unsortedness'' in a sequence is the number o原创 2014-01-04 22:45:41 · 787 阅读 · 0 评论 -
POJ1502_MPI Maelstrom(Dijkstra)(floyd)
MPI MaelstromTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4737 Accepted: 2879DescriptionBIT has recently taken delivery of their new supercomputer, a原创 2014-02-22 21:08:08 · 613 阅读 · 0 评论 -
POJ3461_Oulipo(KMP)
OulipoTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 19729 Accepted: 7920DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La d原创 2014-02-11 17:54:01 · 501 阅读 · 0 评论 -
POJ2503_Babelfish(字典树)
BabelfishTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign lang原创 2014-02-19 00:51:55 · 693 阅读 · 0 评论 -
POJ训练计划1789_Truck History(最小生成树)
Truck HistoryTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16797 Accepted: 6442DescriptionAdvanced Cargo Movement, Ltd. uses trucks of different types原创 2014-04-29 11:25:52 · 661 阅读 · 0 评论 -
POJ训练计划2240_Arbitrage(SPFA)
ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14707 Accepted: 6203DescriptionArbitrage is the use of discrepancies in currency exchange rates原创 2014-05-08 09:58:24 · 12427 阅读 · 0 评论 -
POJ训练计划3026_Borg Maze(最小生成树+BFS)
Borg MazeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7724 Accepted: 2594DescriptionThe Borg is an immensely powerful race of enhanced humanoids from原创 2014-04-29 16:06:35 · 932 阅读 · 0 评论 -
POJ2398_Toy Storage(几何/叉积运用)
解题报告跟poj2318那题一样,ji'shi原创 2014-05-15 12:02:50 · 789 阅读 · 0 评论 -
POJ2318_TOYS( 几何/叉积运用)
解题报告给你一个盒子,然后很多隔板,以及toys的坐标,问你每个隔板里有多少个玩具。原创 2014-05-15 11:08:46 · 657 阅读 · 0 评论 -
POJ训练计划1113_Wall(几何/凸包)
解题报告求城墙最小zhou'c原创 2014-05-14 21:02:34 · 761 阅读 · 0 评论 -
POJ训练计划1611_The Suspects(并查集)
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 19945 Accepted: 9678DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumon原创 2014-02-22 15:52:16 · 605 阅读 · 0 评论 -
POJ3348_Cows(几何/凸包+多边形面积)
解题报告凸包就不多说了,模板。多边形面积嘛,原创 2014-05-15 15:12:19 · 821 阅读 · 0 评论 -
POJ1410_Intersection(几何/线段是否相交/模板)
解题报告判断线段是否与矩形相交,xia原创 2014-05-15 20:28:50 · 732 阅读 · 0 评论 -
POJ2242_The Circumference of the Circle(几何/三角形外接圆周长/模板)
The Circumference of the CircleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7017 Accepted: 4353DescriptionTo calculate the circumference of a circle原创 2014-05-18 19:46:00 · 913 阅读 · 0 评论 -
POJ1003_Hangover(二分求上界)
HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 99245 Accepted: 48092DescriptionHow far can you make a stack of cards overhang a table? If you h原创 2014-05-18 18:04:50 · 651 阅读 · 0 评论 -
POJ训练计划1125_Stockbroker Grapevine(Flody算法)
Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 25573 Accepted: 14118DescriptionStockbrokers are known to overreact to rumours. Y原创 2014-05-12 17:03:32 · 716 阅读 · 0 评论 -
POJ1269_Intersecting Lines(计算几何/两直线位置关系模板)
解题报告判断两个直线的平面关系。。。原创 2014-05-13 17:52:00 · 721 阅读 · 0 评论 -
POJ训练计划2187_Beauty Contest(几何/凸包)
解题报告刚学凸包,看着dabaishu原创 2014-05-14 10:39:39 · 698 阅读 · 0 评论 -
POJ训练计划3687_Labeling Balls(拓扑排序)
Labeling BallsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9949 Accepted: 2738DescriptionWindy has N balls of distinct weights from 1 unit to N units原创 2014-06-02 15:50:57 · 606 阅读 · 0 评论 -
POJ训练计划1426_Find The Multiple(BFS)
Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 17011 Accepted: 6929 Special JudgeDescriptionGiven a positive integer n, write a pr原创 2014-06-04 14:34:59 · 505 阅读 · 0 评论 -
POJ训练计划1321_棋盘问题(DFS)
棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21357 Accepted: 10612Description在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求原创 2014-06-03 18:57:05 · 617 阅读 · 0 评论 -
POJ训练计划1753_Flip Game(枚举+BFS)
DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying原创 2014-04-25 13:43:01 · 579 阅读 · 0 评论 -
POJ训练计划3087_Shuffle'm Up(模拟)
Shuffle'm UpTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5298 Accepted: 2509DescriptionA common pastime for poker players at a poker table is to shuf原创 2014-06-04 18:40:26 · 615 阅读 · 0 评论 -
POJ训练计划3009_Curling 2.0(DFS)
Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10731 Accepted: 4522DescriptionOn Planet MM-21, after their Olympic games this year, curling原创 2014-06-04 16:47:31 · 521 阅读 · 0 评论 -
POJ训练计划2388_Who's in the Middle(排序)
解题报告#include #include using namespace std;int main(){ int n,num[100000]; cin>>n; for(int i=0;i<n;i++) { cin>>num[i]; } sort(num,num+n); cout<<num[n/2]<<endl原创 2014-05-22 11:57:24 · 526 阅读 · 0 评论 -
POJ1149_PIGS(网络流/EK)
PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15721 Accepted: 7021DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mi原创 2014-07-16 13:01:49 · 797 阅读 · 0 评论 -
POJ2080_Calendar(模拟)
解题报告本来就是水题,模拟模拟就过了,谁知懂判断ru原创 2014-05-22 18:01:08 · 528 阅读 · 0 评论 -
POJ训练计划3278_Catch That Cow/SDUT2782_我跳我跳我跳跳跳(一维BFS)
FightingTime Limit: 1000MS Memory limit: 65536K题目描述怒海争锋是一个新游戏,类似于星际争霸。在这个游戏中,敌人建造防御塔,血量为L。玩家有一个军事工厂,可以生产N种战斗舰艇。第i个战舰的生产时间为ti,这战舰每秒钟可以让塔损失血量为li。如果塔的寿命低于或等于0,玩家获胜。注意,在每一秒内,军事工厂只能选择一种战斗原创 2014-02-15 22:54:18 · 659 阅读 · 0 评论 -
POJ训练计划3414_Pots(BFS)
PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9224 Accepted: 3882 Special JudgeDescriptionYou are given two pots, having the volume of A and B原创 2014-06-05 18:11:57 · 469 阅读 · 0 评论 -
POJ2585_Window Pains(拓扑排序)
Window PainsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1548 Accepted: 767DescriptionBoudreaux likes to multitask, especially when it comes to using原创 2014-06-06 19:00:59 · 642 阅读 · 0 评论 -
POJ训练计划2109_Power of Cryptography(贪心)
Power of CryptographyTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 18049 Accepted: 9111DescriptionCurrent work in cryptography involves (among other t原创 2014-06-06 19:19:42 · 694 阅读 · 1 评论 -
POJ训练计划3126_Prime Path(素数+BFS)
解题报告BFS的题,一开始不知道哪里错了,ti'a原创 2014-05-22 22:49:40 · 502 阅读 · 0 评论 -
POJ训练计划2488_A Knight's Journey(DFS+回溯)
A Knight's JourneyTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescriptionBackgroundThe knight is getting bored of seeing the same black and white原创 2014-04-09 01:21:11 · 696 阅读 · 0 评论 -
POJ训练计划2049_Finding Nemo(建图/BFS)
解题报告卡了很久很久的题,原创 2014-05-22 11:30:56 · 697 阅读 · 0 评论 -
POJ训练计划2506_Tiling(递推)
TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7352 Accepted: 3584DescriptionIn how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?原创 2014-06-08 11:42:14 · 717 阅读 · 0 评论 -
POJ训练计划3083_Children of the Candy Corn(BFS+DFS+回溯)
Children of the Candy CornDescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopat原创 2014-04-25 22:27:37 · 648 阅读 · 0 评论 -
POJ训练计划2251_Dungeon Master(三维BFS)
#include #include #include #include #include using namespace std;int l,r,c;struct node{ int x,y,z,step;};char mmap[35][35][35];int vis[35][35][35];int dx[]= {0,0,0,0,1,-1};int dy[]= {原创 2014-05-08 11:53:33 · 13976 阅读 · 0 评论 -
POJ训练计划1068_Parencodings(模拟)
ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19144 Accepted: 11544DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses.原创 2014-06-08 18:05:09 · 608 阅读 · 0 评论