POJ训练计划
文章平均质量分 84
「已注销」
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ训练计划1258_Agri-Net(最小生成树)
Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 37835 Accepted: 15228 Description Farmer John has been elected mayor of his town! One of his campa原创 2014-06-06 20:17:59 · 659 阅读 · 0 评论 -
POJ训练计划2299_Ultra-QuickSort(线段树/单点更新)
解题报告 题意: 求逆序数。 思路: 线段树离散化处理。 #include #include #include #include #define LL long long using namespace std; LL sum[2001000],num[501000],_hash[501000]; void push_up(int rt) { sum[rt]=sum[rt原创 2014-08-10 23:37:08 · 2733 阅读 · 0 评论 -
POJ训练计划2513_Colored Sticks(字典树+判断欧拉通路)
解题报告 题意: 问给原创 2014-07-28 20:23:37 · 970 阅读 · 0 评论 -
POJ训练计划2528_Mayor's posters(线段树/成段更新+离散化)
解题报告 地址传送门 题意: 一些海报,覆盖上去后还能看到几张。 思路: 第一道离散化的题。 离散化的意思就是区间压缩然后映射。 给你这么几个区间[1,300000],[3,5],[6,10],[4,9] 区间左右坐标排序完就是 1,3,4,5,6,9,10,300000; 1,2,3,4,5,6, 7 ,8; 我们可以把上面的区间映射成[1,8],[2,4],[5,7],[原创 2014-08-10 15:21:26 · 34414 阅读 · 1 评论 -
POJ训练计划2485_Highways(最小生成树)
Highways Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21103 Accepted: 9743 Description The island nation of Flatopia is perfectly flat. Unfortunately, F原创 2014-06-06 20:12:57 · 776 阅读 · 0 评论 -
POJ训练计划2299_Ultra-QuickSort(归并排序求逆序数)
Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 39279 Accepted: 14163 Description In this problem, you have to analyze a particular sorting原创 2014-06-20 11:56:39 · 1093 阅读 · 0 评论 -
POJ训练计划1062_昂贵的聘礼(最短路)
昂贵的聘礼 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 35560 Accepted: 10171 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给原创 2014-06-16 17:45:04 · 1015 阅读 · 0 评论 -
POJ训练计划2503_Babelfish(二分)
Babelfish Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 30751 Accepted: 13244 Description You have just moved from Waterloo to a big city. The people her原创 2014-06-01 20:47:01 · 652 阅读 · 0 评论 -
POJ训练计划3687_Labeling Balls(拓扑排序)
Labeling Balls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9949 Accepted: 2738 Description Windy has N balls of distinct weights from 1 unit to N units原创 2014-06-02 15:50:57 · 648 阅读 · 0 评论 -
POJ训练计划1840_Eqs(二分)
Eqs Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 11729 Accepted: 5744 Description Consider equations having the following form: a1x13+ a2x23+ a3x33+ a原创 2014-06-02 13:43:52 · 637 阅读 · 0 评论 -
POJ训练计划3041_Asteroids(二分图/最小点覆盖=最大匹配)
解题报告 题意: 给出NxN的矩阵,有M个点是障碍 每次只能删除一行或者一列,最少删除多少次才能清除障碍 思路: 把行和列看作两个集合结点,把障碍看作集合结点的连线,这样就转化成求用最少的点来消灭边,也就是最小点覆盖。 在二分图中:(n个结点,且没有孤立的点) 最小点覆盖=最大匹配 最大点独立=结点数-最大匹配 #include #inclu原创 2014-07-26 01:14:03 · 1526 阅读 · 0 评论 -
POJ训练计划3259_Wormholes(Bellman-Ford)(SPFA)
Wormholes Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description While exploring his many farms, Farmer John has discovered a number of amazing wormholes原创 2014-02-26 14:40:39 · 677 阅读 · 0 评论 -
POJ训练计划3096_Surprising Strings(STL/map)
解题报告 题目传送门 题意: 给一个字符串,要求,对于这个字符串空隔为k取字符对(k=0,1,2,3,4...)要求在相同的空隔取对过程汇总,整个字符串中没有一个相同字符对如: ZGBZ: 间隔为0的字符对有: ZG、GB、BZ,三个均不相同 间隔为1的字符对有: ZG、 GZ,均不相同 间隔为2的字符对有: ZZ 仅有一个,不必比较。 这种字符串定义为原创 2014-08-09 19:44:22 · 2398 阅读 · 0 评论 -
POJ训练计划2632_Crashing Robots(模拟)
Crashing Robots Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description In a modernized warehouse, robots are used to fetch the goods. Careful planning原创 2014-03-21 15:39:11 · 731 阅读 · 0 评论 -
POJ训练计划1573_Robot Motion(递归)
Robot Motion Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Description A robot has been programmed to follow the instructions in its path. Instruction原创 2014-03-21 10:51:25 · 748 阅读 · 0 评论 -
POJ训练计划3993_Emag eht htiw Em Pleh(模拟)
Emag eht htiw Em Pleh Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description This problem is a reverse case of the problem 2996. You a原创 2014-03-20 15:38:04 · 771 阅读 · 0 评论 -
POJ训练计划3083_Children of the Candy Corn(BFS+DFS+回溯)
Children of the Candy Corn Description The 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 · 696 阅读 · 0 评论 -
POJ训练计划2524_Ubiquitous Religions(并查集)
Ubiquitous Religions Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 22782 Accepted: 11233 Description There are so many different religions in the world t原创 2014-06-07 20:23:19 · 493 阅读 · 0 评论 -
POJ训练计划3278_Catch That Cow/SDUT2782_我跳我跳我跳跳跳(一维BFS)
Fighting Time Limit: 1000MS Memory limit: 65536K 题目描述 怒海争锋是一个新游戏,类似于星际争霸。在这个游戏中,敌人建造防御塔,血量为L。玩家有一个军事工厂,可以生产N种战斗舰艇。第i个战舰的生产时间为ti,这战舰每秒钟可以让塔损失血量为li。如果塔的寿命低于或等于0,玩家获胜。注意,在每一秒内,军事工厂只能选择一种战斗原创 2014-02-15 22:54:18 · 709 阅读 · 0 评论 -
POJ训练计划2109_Power of Cryptography(贪心)
Power of Cryptography Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 18049 Accepted: 9111 Description Current work in cryptography involves (among other t原创 2014-06-06 19:19:42 · 731 阅读 · 1 评论 -
POJ训练计划2488_A Knight's Journey(DFS+回溯)
A Knight's Journey Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description Background The knight is getting bored of seeing the same black and white原创 2014-04-09 01:21:11 · 739 阅读 · 0 评论 -
POJ训练计划2049_Finding Nemo(建图/BFS)
解题报告 卡了很久很久的题,原创 2014-05-22 11:30:56 · 740 阅读 · 0 评论 -
POJ训练计划3414_Pots(BFS)
Pots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9224 Accepted: 3882 Special Judge Description You are given two pots, having the volume of A and B原创 2014-06-05 18:11:57 · 519 阅读 · 0 评论 -
POJ训练计划3009_Curling 2.0(DFS)
Curling 2.0 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10731 Accepted: 4522 Description On Planet MM-21, after their Olympic games this year, curling原创 2014-06-04 16:47:31 · 564 阅读 · 0 评论 -
POJ训练计划3087_Shuffle'm Up(模拟)
Shuffle'm Up Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5298 Accepted: 2509 Description A common pastime for poker players at a poker table is to shuf原创 2014-06-04 18:40:26 · 656 阅读 · 0 评论 -
POJ训练计划1426_Find The Multiple(BFS)
Find The Multiple Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17011 Accepted: 6929 Special Judge Description Given a positive integer n, write a pr原创 2014-06-04 14:34:59 · 542 阅读 · 0 评论 -
POJ训练计划1321_棋盘问题(DFS)
棋盘问题 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21357 Accepted: 10612 Description 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求原创 2014-06-03 18:57:05 · 663 阅读 · 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 · 14024 阅读 · 0 评论 -
POJ训练计划3126_Prime Path(素数+BFS)
解题报告 BFS的题,一开始不知道哪里错了,ti'a原创 2014-05-22 22:49:40 · 541 阅读 · 0 评论 -
POJ训练计划2996_Help Me with the Game(模拟)
Help Me with the Game Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description Your task is to read a picture of a chessboard position and print it in th原创 2014-03-20 15:35:45 · 682 阅读 · 0 评论 -
POJ训练计划3349_Snowflake Snow Snowflakes(哈希)
Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 29924 Accepted: 7868 Description You may have heard that no two snowflakes are al原创 2014-05-31 20:35:17 · 711 阅读 · 0 评论 -
POJ训练计划3080_Blue Jeans(串处理/暴力)
Blue Jeans Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11542 Accepted: 4962 Description The Genographic Project is a research partnership between IBM a原创 2014-06-13 17:09:52 · 1004 阅读 · 0 评论 -
POJ训练计划2418_Hardwood Species(Trie树)
解题报告 Tire树。 #include #include #include #include using namespace std; struct node { int v; node *next[256]; }; int cnt=0,q; char ch[100],str1[100]; node *newnode() { node *p=new node;原创 2014-07-23 19:48:10 · 1020 阅读 · 0 评论 -
POJ训练计划1035_Spell checker(串处理/暴力)
POJ训练计划原创 2014-06-12 20:25:44 · 1615 阅读 · 0 评论 -
POJ训练计划1936_All in All(串处理)
POJ训练计划原创 2014-06-12 20:29:46 · 1982 阅读 · 0 评论 -
POJ训练计划1094_Sorting It All Out(拓扑排序)
Sorting It All Out Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 26348 Accepted: 9120 Description An ascending sorted sequence of distinct values is one原创 2014-05-28 20:49:51 · 589 阅读 · 0 评论 -
POJ训练计划3295_Tautology(构造/类栈处理)
Tautology Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9156 Accepted: 3502 Description WFF 'N PROOF is a logic game played with dice. Each die has six f原创 2014-06-10 23:35:13 · 621 阅读 · 0 评论 -
POJ训练计划1459_Power Network(网络流最大流/Dinic)
解题报告 这题建模实在是好建,,,好贱,,, 给前向星给跪了,纯dinic的前向星竟然TLE,sad,,,回头看看优化,,, 矩阵跑过了,2A,sad,,, /************************************************************************* > File Name: PowerN.cpp > Author: _nplu原创 2014-07-19 11:25:29 · 1043 阅读 · 0 评论 -
POJ训练计划1068_Parencodings(模拟)
Parencodings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 19144 Accepted: 11544 Description Let S = s1 s2...s2n be a well-formed string of parentheses.原创 2014-06-08 18:05:09 · 659 阅读 · 0 评论 -
POJ训练计划2506_Tiling(递推)
Tiling Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7352 Accepted: 3584 Description In how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?原创 2014-06-08 11:42:14 · 769 阅读 · 0 评论
分享