- 博客(3)
- 收藏
- 关注
RSS订阅原创 骑士旅行
广度优先搜索var i,j,k,l,n,m,ans:longint; a:array[0..10000,0..10000] of longint; s:array[0..10000,1..3]of longint; f:array[0..20000] of longint; w:array[1..2] of longint;
2016-12-22 16:10:04
425
原创 电子老鼠闯迷宫
广度优先搜索var i,n,m,j,max,ans,l:longint; a,s:array[0..1000,0..1000] of longint; f:array[0..1000] of longint; w:array[1..2,1..2] of longint; fx:array[1..4,1..2]
2016-12-21 17:47:33
785
原创 排队取水
var i,n,m,j,ans:longint; r:real; a,b,c:array[1..10000] of longint;procedure dp(l,r:longint);var i,j,key,m:longint;begin if l>r then exit; i:=l; j:=r; key:=a[(l+r) div 2]; repeat while (a[
2016-12-08 17:08:03
607
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人