kyrie lrving的博客

P uses math; var len,fai,cnt,num:array[0..300000]of int64; next:array[0..300000,'a'..'z']of longint; p,n,last,now,cur,i:longint; ans:int64; ss:ansistring;

int update(int x) { if (x==0) return 0; 标记下传; } int son(int x) { if (t[f[x]][0]==x) return 0; return 1; } int rotate(int x) { int y=f[x],z=son(x); t[y][z]=t[x][

P uses math; var a,f:array[0..1000000]of longint; i,n,m,p,x1,y1,s:longint; procedure make(v,l,r:longint); var w,g:longint; begin if l=r then begin

P function find(t:longint):boolean; var i,q:longint; begin for i:=1 to n do if (map[t,x[i]])and(not mark[x[i]]) then begin q:

function jia(s1,s2:ansistring):ansistring; var a,b,c:array[0..1000]of longint; i:longint; ss:string; begin jia:=''; fillchar(a,sizeof(a),0); fillchar(b,

P uses math; var sg:ansistring; s:array[0..100000]of char; i,n,x,g,l,j,p,h,ma,t1,t2,ans:longint; w,v,y,ss,r,wa,ex,z,o:array[0..200000]of longint; a:array[0.....

P var tt,n,i,tot:longint; next:array[0..300000,'a'..'z']of longint; en,fai:array[0..300000]of longint; o,zd:ansistring; procedure insert(x:ansistring); var l...