PAT 甲级 1067 Sort with Swap(0, i) (25 分)

最新推荐文章于 2024-09-11 00:16:09 发布

编程龙

最新推荐文章于 2024-09-11 00:16:09 发布

阅读量79

点赞数

分类专栏： PAT编程

本文链接：https://blog.csdn.net/qq_45478482/article/details/120070709

版权

算法

PAT编程专栏收录该内容

97 篇文章 0 订阅

订阅专栏

题目描述

Given any permutation of the numbers {0, 1, 2,…, N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, 1, 3} we may apply the swap operations in the following way:
Swap(0, 1) => {4, 1, 2, 0, 3}
Swap(0, 3) => {4, 1, 2, 3, 0}
Swap(0, 4) => {0, 1, 2, 3, 4}
Now you are asked to find the minimum number of swaps need to sort the given permutation of the first N nonnegative integers.

输入

Each input file contains one test case, which gives a positive N $10^5)$ followed by a permutation sequence of {0, 1, …, N−1}. All the numbers in a line are separated by a space.

输出

For each case, simply print in a line the minimum number of swaps need to sort the given permutation.

思路

可以想一下现在有3种情况，当前位置的数字就在当前位置，此时换的次数为0
若不在当前位置，一定能形成一条回路，若这条回路包含0说明0和其他的换一次即可，为N-1次。
若当前回路不包含0，则要把0换进来，为N+1次

代码

#include<iostream>
#include<cstdio>
#include<stdlib.h>
using namespace std;
int pan[110000] = { 0 };
int a[110000];
int ans = 0;
int found(int first)
{
	if (first == a[first])
	{
		return 0;
	}
	int all = 0;
	while (pan[first] == 0)
	{
		pan[first] = 1;
		all++;
		first = a[first];
	}
	if (pan[0] == 1)
	{
		return all - 1;
	}
	else
	{
		return all + 1;
	}
}
int main()
{
	int N;
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> a[i];
	}
	for (int i = 0; i < N; i++)
	{
		pan[0] = 0;
		if(pan[a[i]]==0)
			ans += found(a[i]);
	}
	printf("%d\n", ans);
}