这题很好,先要用图的知识来判断,然后再思维,很牛,等我晚上回去写题解
noip2005(提高组)讲解 - 百度文库官方题解牛牛子
AC代码:
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
typedef pair<int, int> PII;
const double pi = acos(-1.0);
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define rrep(i, n) for (int i = n; i >= (1); --i)
typedef long long ll;
#define sqar(x) ((x)*(x))
const int N = 5e4 + 10;
int vis[N], k1[N], k2[N];
int g[N][2];
int a1[N], a2[N];
int main()
{
int n;
scanf("%d", &n);
rep(i, n) scanf("%d %d", &g[i][0], &g[i][1]);
k1[1] = 1;
for(int i = 2; i <= n; i++)
{
int flag = 0;
for(int j = 0; j < 2; j++)
if(!vis[g[k1[i - 1]][j]]){vis[g[k1[i - 1]][j]] = 1; k1[i] = g[k1[i - 1]][j]; flag = 1; break;}
if(!flag){puts("-1"); return 0;}
}
rep(i, n) k2[n + 1 - i] = k1[i];
int maxx = -1;
for(int i=1;i<=n;i++)
{ //余n,不是余10,看题目
int now = (k1[i] - i + n) % n; //这样是把目标往有移,想移到和初始重合最多
a1[now]++;if(a1[now]>maxx) maxx=a1[now];
now = (k2[i] - i + n) % n; //因为这个式子是有方向的(右移),所以直接把目标反向,就可以找到逆序的那个了
a2[now]++;if(a2[now]>maxx) maxx=a2[now];
}
printf("%d", n - maxx);
return 0;
}