#includeusing namespace std;int a[205]={0},b[205]={0},f[205][205]={0},n,m,la,lb;int max(int x,int y){
return x>y?x:y;}void get(int i, int j){
int x=a,y=b[j];
la=i-1; lb=j-1;
while(a[la]!=y&&la>0)
la--;
while(b[lb]!=x&&lb>0)
lb--;}int main(){
int i,j,t,tt;
cin>>tt;
for(t=1;t>n>>m;
for(i=1;i>a;
for(i=1;i>b;
for(i=1;if[j])
f[j]=f[la-1][lb-1]+2;
}
}
}
cout<<f[n][m]<<endl;
}
return 0;} |
