- 博客(8)
- 收藏
- 关注
原创 归并排序模板w(kl)
procedure sort(var a:array[1..200000] of longint;l,r:longint);var b,c:array[1..200000] of longint;procedure MERGE_SORT(l,r:longint);var mid,i,t1,t2:longint;begin if l<>r then begin mid:
2016-11-11 18:22:41 287
原创 归并排序求逆序对kl
欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来,用它写博客,将会带来全新的体验哦:Markdown和扩展Markdown简洁的语法代码块高亮图片链接和图片上传LaTex数学公式UML序列图和流程图离线写博客导入导出Markdown文件丰富的快捷键快捷键加粗 Ctrl + B 斜体 Ctrl + I 引用 Ctrl
2016-11-11 17:11:13 200
原创 二叉排序堆基础模板题
const ww=’ugly.’; var n,len,i:longint; j,k:int64; heap:array[0..6000] of int64;procedure init; begin assign(input,ww+’in’); reset(input); assign(output,ww+’out’); rewrite(output);
2016-11-09 07:46:44 217
原创 并查集基础题:relation
const ww=’relation.’; maxn=20000;//直接赋值会T var i,m,q:longint; n,x,y,r1,r2:integer; a:array[0..maxn+1] of integer;function findroot(x:integer):integer; var path:array[1..maxn] of longi
2016-11-09 07:45:15 241
原创 dfs压缩 有向带权图
var i,j,total,max,r,path,n,m,x,y,z,s:integer; a:array[0..11] of integer;//链表 b:array[1..100,1..2] of integer;//链表2 c:array[1..100,1..3] of integer;//原表 hash:array[1..100] of boolea
2016-11-03 18:19:49 366
原创 dj 模板
var a:array[0..100,0..100] of integer; b,c,h:array[0..100] of integer; i,j,n,m,x,y,z:integer; qwq:integer;procedure DJ(k:integer);var i,q,t,s:integer; w:boolean;begin s:=
2016-11-03 18:09:08 293
原创 bfs
var a:array[1..100,1..100] of 0..1; v:array[1..100] of boolean; i,j,n:integer;procedure bfs;var q:array[1..100] of integer; l,r:integer; begin l:=1;r:=1;q[l]:=1;
2016-11-03 12:27:00 161
原创 极烦的bfs·迷宫
var i,j,n,m,x,y,tot:integer; a:array[1..1000,1..1000] of char; que:array[1..1000,1..2] of integer; v:array[1..1000,1..1000] of boolean; xx:array[1..4] of integer = (0,1,0,-1);
2016-11-03 12:20:17 192
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人