- 博客(15)
- 收藏
- 关注
RSS订阅转载 Dijkstra
1 program dijkstra; 2 var 3 a:array[1..100,1..100]of integer; 4 flag:array[1..100]of boolean; 5 w,x,n,i,j,min,minn:integer; 6 begin 7 readln(n); 8 for i:=1 to...
2015-04-06 00:47:00
82
转载 USACO 2.1.1 The Castle
{ID:anniel11PROG:castleLANG:PASCAL}var a:array[0..50,0..50 ,1..4] of boolean; component:array[0..50,0..50] of integer;//which room does it belong to room_size:array[0....
2015-02-22 07:39:00
121
转载 【USACO】name that number
{ID: anniel11PROG: namenumLANG: PASCAL}Program namenum;var i,n,l:integer; s,s2:string; dicl:array[1..12] of integer; dic:array[1..12,1..2000] of integer;function trans...
2014-09-11 16:27:00
83
转载 【USACO】transformations
{ID: anniel11PROG: transformLANG: PASCAL}Program transform;Var temp:boolean; c:char; i,j,n,sum,head,tail:longint; map1,map2:array[1..10,1..10] of boolean; f...
2014-09-11 15:28:00
67
转载 【USACO】milking cows
{ID: anniel11PROG: milk2LANG: PASCAL}Program milk2;Var ans1,ans2,i,j,n,sum,head,tail:longint; a:array[1..5000,1..2] of longint; map:array[1..100000] of integer; ...
2014-09-11 14:54:00
77
转载 【VIJOS】P1037 搭建双塔
f[i-1,t] →把h[i]给了f[i-1,t]后 f[i-1,t]+h[i]=f[i,j]+j; 原低塔变高塔 现低塔高度→(f[i-1,t]+t)< 现高塔高度→ f[i-1,t]+h[i] (t<h[i]) →f[i,h[i]] →j=h[i]-t t=h[i]-j; f[i-1,t] → ...
2013-09-24 12:41:00
142
转载 【USACO】Big Barn,1997 Fall
题目本身不难 但是要用滚动数组，否则10000*10000的integer会爆128M考虑记sqrr[i,j] 为以[i,j]为右下角向左上扩展的正方形的最大值，up[i,j]为以[i,j]为最后一格能向上扩展的最大值,left[i,j]同理则sqrr[i,j]=min(sqrr[i-1,j-1]+1,up[i,j],left[i,j]);可以看到第i行状态只与i-1行有关...
2013-09-23 12:38:00
93
转载 【USACO】Apple Catching 2004,Nov
时间：近1h总结：速度实在是太慢了……主要是问题没想清楚方程：记f[i,j]为考虑前i个果子，剩余移动次数还有j次时能吃到的最大果子数则 f[i-1,j]+1 (t[i]=t[i-1])f[i,j]= max{f[i-1,j+1]+1,f[i-1,k](the nearest k such that t[k]=t[i])} (t[i]<&g...
2013-09-21 20:32:00
134
转载 【数据结构】点修改段查询
1 var 2 a,b:array[0..10000] of integer; 3 i,n:integer; 4 procedure edit(l,r,delta:integer); 5 var 6 i:integer; 7 begin 8 b[l]:=b[l]+delta; 9 b[r+1]:=b[r+1]-...
2013-08-14 14:03:00
79
转载 【数据结构】Binary_Indexed_Tree
点修改 段求和 1 var 2 a:array[1..100000] of integer; 3 t:array[1..100000] of longint; 4 i,j,n:integer; 5 function lowbit(x:integer):integer; 6 begin 7 exit(x and (-x)); ...
2013-08-14 13:43:00
52
转载 【USACO】Watering Hole 2008 Oct
【算法】MST-Prim①初步思路就是最小生成树，那么打井操作怎么办呢？ 打井操作可看做是尤一个超级水源引出水，且代价为Wi的操作，所以加一个“超级点”就可以了，接着MST 1 var 2 n,heapsize,now,i,j:integer; 3 temp,mst:longint; 4 v:array[1..301,1.....
2013-08-14 00:10:00
69
转载 【数据结构】MST-Prim
1 var 2 d,place,a:array[1..10000] of longint; 3 now,MST,heapsize,i,n,x1,x2,x3,m:integer; 4 done:array[1..10000] of boolean; 5 e:array[1..10000,1..10000] of integer; 6 ...
2013-08-13 21:19:00
149
转载 【数据结构】MST-Kruskal
使用并查集 1 var 2 x1,x2,x3,n,m,i,j,mst:integer; 3 head,tail,u,p:array[1..1000] of integer; 4 procedure qsort(l,r:integer); 5 var 6 i,j,mid,temp:integer; 7 begin 8 i:=l...
2013-08-13 18:41:00
140
转载 【数据结构】Union-find
1 var 2 father:array[1..10000] of integer; 3 n,i:integer; 4 function getfather(a:integer):integer; 5 begin 6 if father[a]=0 then exit(0); 7 father[a]:=getfather(father[a]...
2013-08-13 18:38:00
84
转载 【数据结构】LIS
1 var 2 a,f:array[1..1000] of integer; 3 n,i,j,max:integer; 4 begin 5 readln(n); 6 for i:=1 to n do read(a[i]); 7 for i:=1 to n do 8 begin 9 max...
2013-08-13 18:37:00
138
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人