这道题就是让你把每个晾衣绳的位置排一下序,输出排序的次数就好了
我却没发现
C
o
d
e
Code
Code
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int n,a[1110],b[1110],z,ans,w[1110];
int main()
{
freopen("laundry.in","r",stdin);
freopen("laundry.out","w",stdout);
cin>>n;
for(int i=1; i<=n; i++)
cin>>a[i]>>b[i];
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(a[i]==b[j])
w[i]=j;
for(int i=1; i<=n-1; i++) //冒泡排序
for(int j=1; j<=n-i; j++)
if(w[j]>w[j+1])
{
z=w[j];
w[j]=w[j+1];
w[j+1]=z;
ans++;
}
cout<<ans;
return 0;
}