poj
文章平均质量分 59
hugedata
这个作者很懒,什么都没留下…
展开
-
poj2524Ubiquitous religions…
var n,m,x,y,i,ans,k:longint; f:array[1..50000] of longint; h:array[1..50000] of boolean;function findset(x:longint):longint;begin if x<>f[x] thenf[x]:=findset(f[x]); exit(f[x]);end;proc原创 2013-11-04 21:43:06 · 567 阅读 · 0 评论 -
poj1321棋盘问题{wa}
var n,k,i,j,ans:longint; vx,vy:array[1..8] of boolean; map:array[1..8,1..8] of char;procedure dfs(x,y,now:longint);var j,l:integer;begin if now=k then inc(ans) else begin for原创 2013-11-04 21:45:05 · 738 阅读 · 0 评论 -
A Bug's Life -Poj
原文地址:Bug's Life -Poj">A Bug's Life -Poj作者:兰多夫87A Bug's LifeTime Limit: 10000MS Memory Limit:65536KTotal Submissions: 25599 Accepted:8332DescriptionBackground Professor Hopper is researching th转载 2013-11-04 21:44:35 · 831 阅读 · 0 评论 -
POJ1088滑雪
暴搜飘过。。。{记忆化}VAR R,L,I,J,MAX:lONGINT; DX:ARRAY[1..4] OF INTEGER=(1,-1,0,0); DY:ARRAY[1..4] OF INTEGER=(0,0,-1,1); H:ARRAY[1..100,1..100] OF LONGINT; F:ARRAY[1..100,1..100] OF LONGINT;FUNC原创 2013-11-04 21:44:59 · 585 阅读 · 0 评论 -
poj2236 wireless network并查集
var n,d,i,j,a,b,m:longint; s:char; x,y,f:array[1..1001] of longint; used:array[1..1001] of boolean; w:array[1..1001,1..1001] of real;function findset(x:longint):longint;begin if x f[原创 2013-11-04 21:43:08 · 591 阅读 · 0 评论 -
1548 Robots{偏序集}{WA求解}
var a,b,n:longint; x,y:array[1..600] of longint; f:array[1..600] of longint;procedure swap(var a,b:longint);var t:longint;begin t:=a;a:=b;b:=t;end;procedure qsort(l,r:longint);var i,原创 2013-11-04 21:43:38 · 634 阅读 · 0 评论 -
2253Frogger{dijkstra思想应用}{AC…
var n,count:longint; x,y:array[1..200] of longint; w:array[1..200,1..200] of real; f:array[1..200] of real; used:array[1..200] of boolean;function init:boolean;var i,j:longint;begin r原创 2013-11-04 21:43:45 · 518 阅读 · 0 评论 -
2485highways{最小生成树}
var t,m,n,k,ans:longint; w:array[1..500,1..500] of longint; d:array[1..500] of longint; used:array[1..500] of boolean;procedure init;var i,j:longint;begin fillchar(d,sizeof(d),0); fil原创 2013-11-04 21:44:02 · 563 阅读 · 0 评论 -
poj3259
Language:DefaultWormholesTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 26296Accepted: 9468DescriptionWhile exploring his many farms, Farmer John has discovered anum原创 2013-11-04 21:44:44 · 634 阅读 · 0 评论 -
poj2492 A bug's life{种类并查集}
A Bug'sLifeTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 25605Accepted: 8334DescriptionBackground Professor Hopper is researching the sexual behavior of a rarespeci原创 2013-11-04 21:44:42 · 762 阅读 · 0 评论 -
1065wooden sticks{偏序集dil…
var t,k,i,j,n:longint; l,w:array[1..5000] of longint;procedure swap(var a,b:longint);var t:longint;begin t:=a;a:=b;b:=t;end;procedure qsort(le,ri:longint);var i,j,ml,mw:longint;begin原创 2013-11-04 21:43:34 · 621 阅读 · 0 评论 -
2349Arctic Network{最小生成…
var c,s,p,i:longint; x,y:array[1..500] of longint; w:array[1..500,1..500] of real; d:array[1..500] of real; used:array[1..500] of boolean;procedure init;var i,j:longint;begin fillchar原创 2013-11-04 21:43:43 · 478 阅读 · 0 评论 -
poj1723soldiers{中位数,曼哈顿距…
{通过样例,WA,不知道错在哪里,请指教}type arr=array[1..10000] of longint;var n,i,x0,y0:longint; ans:int64; x,y:array[1..10000] of longint;procedure swap(var a,b:longint);var t:longint;begin t:=a;a:=b;b:=t;原创 2013-11-04 21:44:24 · 744 阅读 · 0 评论 -
poj1703Find them catch them
Find them, Catch themTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 26679Accepted: 8090DescriptionThe police office in Tadu City decides to say endsto the chaos, as lau原创 2013-11-04 21:44:37 · 616 阅读 · 0 评论 -
poj1611 The suspect并查集
AC啦var n,m,i,j,t,ans,k:longint; f:array[0..30000] of longint; a:array[1..30000] of longint;function findset(x:longint):longint;begin if x f[x]:=findset(f[x]); exit(f[x]);end;proced原创 2013-11-04 21:43:01 · 610 阅读 · 0 评论 -
(未完成)1182食物链
参考题解,讲得很详细:http://www.cnblogs.com/Missa/archive/2012/07/22/2604220.htmltype data=record d,x,y:longint; end;var n,k,i,ans,x,y:longint; e:array[1..100000] of data; f:array[1..50000] of原创 2013-11-04 21:43:10 · 554 阅读 · 0 评论 -
3636 nested dolls{dilworth}
var t,k,i,j,n:longint; l,w:array[1..20000] of longint;procedure swap(var a,b:longint);var t:longint;begin t:=a;a:=b;b:=t;end;procedure qsort(le,ri:longint);var i,j,ml,mw:longint;begin原创 2013-11-04 21:43:36 · 632 阅读 · 0 评论 -
3070Fibonacci{矩阵快速幂}
{N久以前的一道题,今天终于水过了啊。。。这个矩阵好神奇啊}type node=array[1..2,1..2] of longint;const max=10000;var n:longint; a:node;function init:boolean;begin read(n); if n=-1 then exit(false); a[1,1]:=1; a原创 2013-11-04 21:43:49 · 524 阅读 · 0 评论 -
poj1160post office{动态规划…
var v,p,i,j,pos:longint; x:array[1..300] of longint; w:array[1..300,1..300] of longint; f:array[1..300,0..30] of longint;procedure swap(var a,b:longint);var t:longint;begin t:=a;a:=b;b:原创 2013-11-04 21:44:26 · 679 阅读 · 0 评论