fork(1) download
  1. #include <iostream>
  2. using namespace std;
  3. int find(int b[],int m,int n){
  4. int i;
  5. for(i=1;i<=m;i++){
  6. if(b[i]==n)
  7. return i;
  8. }
  9. }
  10. int main() {
  11. int n,p,count,counter,found,i,j,k,final;
  12. while(scanf("%d",&n)!=EOF){
  13. final=0;
  14. int a[n+1],b[n+1],c[n+1][n+1];
  15. for( i=1;i<=n;i++){
  16. scanf("%d",&a[i]);
  17. }
  18. for( j=1;j<=n;j++){
  19. scanf("%d",&b[j]);
  20. }
  21. for( i=1;i<=n;i++){
  22. counter=0;
  23. count=0;
  24. for(j=i;j<=n;j++){
  25.  
  26. if(i==j)
  27. c[a[i]][a[i]]=0;
  28. else
  29. {c[a[i]][a[j]]=1;
  30. counter++;
  31. c[a[j]][a[i]]=0;
  32. }
  33. }
  34. p=a[i];
  35. found=find(b,n,p);
  36. for( k=found+1;k<=n;k++){
  37. if(c[a[i]][a[k]]==1){
  38. c[a[i]][a[k]]=0;
  39. count++;
  40. }
  41. }
  42. final+=(counter-count);
  43. }
  44. cout<<final<<endl;
  45. }
  46. return 0;
  47. }
  48.  
Success #stdin #stdout 0s 3344KB
stdin
5
1 2 3 4 5
3 1 2 5 4
5
3 1 2 5 4
1 2 3 4 5
5
3 1 2 5 4
5 3 2 1 4
stdout
3
3
3