POJ
文章平均质量分 68
better_space
这个作者很懒,什么都没留下…
展开
-
【poj1995】Raising Modulo Numbers
#include<stdio.h> __int64 quickpow(int m,int n,int s) { __int64 ans=1,base=m; while(n) { if(n&1) { ans=ans*base%s; } base=base*base%s; n>>=1; }原创 2016-07-23 15:54:27 · 244 阅读 · 0 评论 -
【Poj1703】Find them, Catch them(关系并查集)
Find them, Catch them Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 42064 Accepted: 12936 Description The police office in Tadu City decides to say end原创 2016-09-27 16:33:58 · 248 阅读 · 0 评论 -
【POJ3321】Apple Tree
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 26622 Accepted: 7900 Description There is an apple tree outside of kaka's house. Every autumn, a原创 2016-08-18 10:18:11 · 301 阅读 · 0 评论 -
【POJ1383】Labyrinth
Labyrinth Time Limit: 2000MS Memory Limit: 32768K Total Submissions: 4333 Accepted: 1640 Description The northern part of the Pyramid contains a very large and comp原创 2016-08-24 09:28:03 · 297 阅读 · 0 评论 -
【POJ2533】Longest Ordered Subsequence
Longest Ordered Subsequence Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 47040 Accepted: 20904 Description A numeric sequence of ai is ordered if a1 a2原创 2016-08-11 10:45:17 · 307 阅读 · 0 评论 -
【POJ1745】Divisibility
Divisibility Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11568 Accepted: 4155 Description Consider an arbitrary sequence of integers. One can place + o原创 2016-08-09 20:00:06 · 226 阅读 · 0 评论 -
【POJ2559】Largest Rectangle in a Histogram
Largest Rectangle in a Histogram Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19452 Accepted: 6267 Description A histogram is a polygon composed of a原创 2016-08-21 11:05:57 · 442 阅读 · 0 评论 -
【POJ3250】Bad Hair Day
Bad Hair Day Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 17576 Accepted: 5926 Description Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a原创 2016-08-20 00:02:42 · 346 阅读 · 0 评论 -
【POJ3419】Difference Is Beautiful
Difference Is Beautiful Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 2247 Accepted: 703 Description Mr. Flower's business is growing much faster than原创 2016-09-10 00:37:16 · 357 阅读 · 0 评论 -
【poj3264】Balanced Lineup
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 47436 Accepted: 22281 Case Time Limit: 2000MS Description For the daily milking, Far原创 2016-09-06 23:51:26 · 216 阅读 · 0 评论 -
【POJ3264】Balanced Lineup
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 47142 Accepted: 22121 Case Time Limit: 2000MS Description For the daily milking, Far原创 2016-08-18 19:44:07 · 252 阅读 · 0 评论 -
【POJ3461】Oulipo
Oulipo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 35904 Accepted: 14492 Description The French author Georges Perec (1936–1982) once wrote a book, La原创 2016-08-16 16:28:02 · 273 阅读 · 0 评论 -
【POJ2463】Bungee Jumping
Bungee Jumping Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1365 Accepted: 604 Description Once again, James Bond is fleeing from some evil people who原创 2016-08-13 20:26:15 · 388 阅读 · 0 评论 -
【poj1979】Red and Black
题意:从’@‘开始找上下左右相邻的’.’的个数。#include<stdio.h> const int N = 22; char c[N][N]; int m,n,ans; int px[4]= {1,-1,0,0}; int py[4]= {0,0,1,-1}; void dfs(int x,int y) { c[x][y]='#'; ans++; for(int l=0;原创 2016-07-29 09:10:33 · 309 阅读 · 0 评论 -
【POJ2251】Dungeon Master
用BFS简单些,无非就是吧二维数组变成三维数组,过程和其他求是否连通的题目大同小异。 坐标变化是6. 不过这题我写的时候直接在标记出压缩成一行判断,老是得不到正确结果,再看了大神的代码后,增加了check()这一判断函数,就奇迹般的ac了,所以以后对于复杂的判断最好写一个判断函数。 另外我发现大神代码的另一个优点,能减少输入后便利取S和E的循环次数,这种小的优化很重要,值得借鉴。(下方代码中“原创 2016-07-29 23:23:33 · 273 阅读 · 0 评论 -
【POJ3278】Catch That Cow
搜索里应用型的题目。 记得考虑临界情况哦。 BFS代码:#include<stdio.h> #include<queue> #include<string.h> #include<algorithm> using namespace std; const int N = 100000; bool vis[N+100]; int n,m; struct note { int t;原创 2016-07-29 23:28:05 · 222 阅读 · 0 评论 -
【poj3620】Avoid The Lakes
求一个坐标区域内,在给出的几点坐标中上下左右相邻的个数的最大值。#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; const int N = 105; int map[N][N]; int vis[N][N]; int n,m,k,ans; int dir[4][2] = {1, 0, -1,原创 2016-07-29 08:54:42 · 299 阅读 · 0 评论 -
【poj3258】River Hopscotch
这题虽是二分的题,但感觉就是别扭,很难想清楚怎么设置判断。我也是看了别人的判断过程及判断依据后才成功ac。值得收藏的二分题。 判断的过程我尽量解释一下,有不清楚的地方请参阅网址: http://www.cnblogs.com/jingqi814/p/3581553.html这样讲应该能理解的: 1.首先去掉M个石头后两个石头之间会有最小的距离,本题让求这个最小距离的最大值。 2.我们二分是在原创 2016-07-27 18:06:50 · 293 阅读 · 0 评论 -
【POJ1562】Oil Deposits
暂且只用DFS做着,用BFS我老wa“哇。。桑心” DFS:#include<stdio.h> #include<string.h> const int N = 105; int a[N][N],b[N][N]; char c[N][N]; int px[8]= {0,0,1,1,1,-1,-1,-1}; int py[8]= {-1,1,-1,0,1,-1,0,1}; int m,n; void原创 2016-07-29 22:58:09 · 284 阅读 · 0 评论