04 2015 档案

ZOJ2006 (最小表示法）
摘要：var s:ansistring; cas:longint; function minp(st,len:longint):longint; var p1,p2,k,tmp:longint; begin p1:=0; p2:=1; k:=0; while ((p1p2) then exit(p2+st) else exit(p1+st); end; begin re... 阅读全文
posted @ 2015-04-28 10:19 rpSebastian 阅读(231) 评论(0) 推荐(0)
2015-4-18 经典训练1
摘要：T1：皇帝的烦恼二分之后DP判断。 1 var v,a,b:array[0..30008] of longint; 2 n,ans,i,l,r,mid:longint; 3 function max(a,b:longint):longint; 4 begin 5 if a>b the... 阅读全文
posted @ 2015-04-20 07:34 rpSebastian 阅读(156) 评论(0) 推荐(0)
POJ3107 （树的重心）
摘要：const maxn=50008; INF=2000000000;type arr=record u,v,nt:longint; end; arr1=array[0..maxn] of longint;var eg:array[0..maxn*2] of... 阅读全文
posted @ 2015-04-07 20:28 rpSebastian 阅读(147) 评论(0) 推荐(0)
sort
摘要：const maxn=100000;type arr=array[0..maxn] of longint;var a:arr; i,n:longint;procedure swap(var a,b:longint);var c:longint;begin c:=a; a:=b; b:=c... 阅读全文
posted @ 2015-04-07 20:15 rpSebastian 阅读(146) 评论(0) 推荐(0)