fzu三月月赛C题。AC's code

 

三点才知道有fzu月赛囧。。。

一看别人都A了巨多题。。

由于做了还没两小时，我只交了5道。。若爆了。。

还好是中国人出的题目- -英语看下来都木有什么压力。

这场比赛最后一题fft不会。

 

其余的除了C题之外都没什么意思(比赛时候没时间做）

一开始看到C题，想可不可以一位一位来，觉得不可做。后来就想像快排一样找第k大

显然不能直接暴力比较的。于是想说可不可以只以着插入部分比较，直接两个字符串接起来做suffix array

一些比较一下。

(⊙v⊙)嗯后来一次ac了

program p2012; var i,num,tt,test,n,m,k :longint; a,rank,trank,sa,tsa,sum,h :array[0..21000]of longint; f :array[0..21000,0..20]of longint; s,s1,s2 :ansistring; function min(x,y:longint):longint; begin if x<y then exit(x) else exit(y); end; procedure pre; var i :longint; begin fillchar(sum,sizeof(sum),0); for i:=1 to n do begin rank[i]:=ord(s[i]); inc(sum[rank[i]]); end; for i:=1 to 200 do inc(sum[i],sum[i-1]); for i:=n downto 1 do begin sa[sum[rank[i]]]:=i; dec(sum[rank[i]]) end; trank[sa[1]]:=1; m:=1; for i:=2 to n do begin if rank[sa[i]]<>rank[sa[i-1]] then inc(m); trank[sa[i]]:=m; end; for i:=1 to n do rank[i]:=trank[i]; for i:=1 to m do sum[i]:=0; end; procedure suffix; var i,j,p :longint; begin j:=1; while m<n do begin p:=0; for i:=1 to m do sum[i]:=0; for i:=n-j+1 to n do begin inc(p); tsa[p]:=i;end; for i:=1 to n do if sa[i]>j then begin inc(p);tsa[p]:=sa[i]-j; end; for i:=1 to n do begin trank[i]:=rank[tsa[i]]; inc(sum[trank[i]]); end; for i:=1 to m do inc(sum[i],sum[i-1]); for i:=n downto 1 do begin sa[sum[trank[i]]]:=tsa[i]; dec(sum[trank[i]]); end; trank[sa[1]]:=1; m:=1; for i:=2 to n do begin if (rank[sa[i]]<>rank[sa[i-1]])or(rank[sa[i]+j]<>rank[sa[i-1]+j]) then inc(m); trank[sa[i]]:=m; end; for i:=1 to n do rank[i]:=trank[i];j:=j*2; end; end; procedure count; var i,now,k :longint; begin now:=0; s:=s+'!'; for i:=1 to n do begin if rank[i]=1 then h[1]:=0 else begin while s[i+now]=s[sa[rank[i]-1]+now] do inc(now); h[rank[i]]:=now; if now>0 then dec(now); end; end; for i:=1 to n do f[i,0]:=h[i]; for k:=1 to trunc(ln(n)/ln(2)) do for i:=1 to n-1 shl k+1 do f[i,k]:=min(f[i,k-1],f[i+1 shl (k-1),k-1]); end; function rmq(a,b:longint):longint; var tmp,k :longint; begin if a=b then exit(n); a:=rank[a];b:=rank[b]; if a>b then begin tmp:=a;a:=b;b:=tmp; end; inc(a); k:=trunc(ln(b-a+1)/ln(2)); exit(min(f[a,k],f[b-1 shl k+1,k])); end; function cmp(a,b,len:longint):longint; var ll :longint; begin if len=0 then exit(0); ll:=rmq(a,b); if ll>=len then exit(0); if s[a+ll]<s[b+ll] then exit(-1) else exit(1); end; function compare(a,b:longint):longint; var tmp:longint; begin if a=b then exit(0); compare:=1; if a>b then begin tmp:=a;a:=b;b:=tmp;compare:=-1;end; if a+length(s2)<=b then begin tmp:=cmp(length(s1)+2,a+1,length(s2)); if tmp<>0 then exit(tmp*compare); tmp:=cmp(a+1,length(s2)+a+1,b-a-length(s2)); if tmp<>0 then exit(tmp*compare); tmp:=cmp(b+1-length(s2),length(s1)+2,length(s2)); if tmp<>0 then exit(tmp*compare); end else begin tmp:=cmp(length(s1)+2,a+1,b-a); if tmp<>0 then exit(tmp*compare); tmp:=cmp(length(s1)+2+b-a,length(s1)+2,length(s2)-(b-a)); if tmp<>0 then exit(tmp*compare); tmp:=cmp(a+1,length(s1)+2+length(s2)-(b-a)+1,b-a); if tmp<>0 then exit(tmp*compare); end; exit(tmp); end; procedure qsort(l,r:longint); var i,j,mid,tmp :longint; begin if l=r then begin num:=a[l]; exit; end; i:=l;j:=r; mid:=a[(i+j) shr 1]; repeat while compare(a[i],mid) = -1 do inc(i); while compare(mid,a[j]) = -1 do dec(j); if i<=j then begin tmp:=a[i];a[i]:=a[j];a[j]:=tmp; inc(i);dec(j); end; until i>j; if j-l+1>=k then qsort(l,j) else if (j-l+2=k)and(i-j=2) then begin num:=a[j+1];exit;end else begin dec(k,(i-l)); qsort(i,r); end; end; begin assign(input,'1.in');assign(output,'1.out'); reset(input);rewrite(output); readln(Test); while tt<test do begin inc(tt); readln(s1); readln(s2); s:=s1+'*'+s2; n:=length(s); pre; suffix; count; readln(k); for i:=1 to length(s1)+1 do a[i]:=i-1; qsort(1,length(s1)+1); insert(s2,s1,num+1); writeln('Case ',tt,':'); writeln(s1); end; end.