SPOJ0196 musketeers

         经典的线性动态规划，但是状态转移并不难。

         用g表示相互的胜负关系，用f表示是否可以相遇，那么当推出f[i , i+n] 时，就说明，i可以获胜。状态转移方程为f[i,j]:=f[i,k] and f[k,j] and (g[i,k] or g[j,k])。

 

program musketeers; var f,g:array[0..200,0..200] of boolean; ans:array[0..200] of longint; i,t,sum,n:longint; procedure init; var i,j:longint; k:char; begin readln(n); for i:=1 to n do begin for j:=1 to n do begin read(k); if k='0' then begin g[i,j]:=false; g[i+n,j]:=false; g[i,j+n]:=false; g[i+n,j+n]:=false; end else begin g[i,j]:=true; g[i+n,j]:=true; g[i,j+n]:=true; g[i+n,j+n]:=true; end; end; readln; end; readln; end; procedure prework; var i:longint; begin sum:=0; fillchar(f,sizeof(f),0); for i:=1 to n*2-1 do f[i,i+1]:=true; end; procedure main; var i,j,k,p:longint; begin for p:=2 to n do for i:=1 to n*2-p do begin j:=i+p; for k:=i+1 to j-1 do if not f[i,j] then f[i,j]:=f[i,k] and f[k,j] and (g[i,k] or g[j,k]); end; end; procedure outit; var i:longint; begin for i:=1 to n do if f[i,i+n] then begin inc(sum); ans[sum]:=i; end; writeln(sum); for i:=1 to sum do writeln(ans[i]); end; begin assign(input,'a.in'); reset(input); assign(output,'a.out'); rewrite(output); readln(t); for i:=1 to t do begin init; prework; main; outit; end; close(input); close(output); end.