Suit and Tie (在线swap 贪心 思维)

(29条消息) 贪心背后的故事Codeforces 995B(Suit and Tie)_♡-流浪孩的博客-CSDN博客 

Suit and Tie - CodeForces 995B - Virtual Judge (csgrandeur.cn)

题意:

思路:将改变后的位置变为一个特殊的位置比如0,在模拟排座位过程

#include<bits/stdc++.h>
#define x first
#define gcfx main
#define y second
#define mak make_pair
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define debug(a) cout<<a<<'\n'
#define endl '\n'
#define umap unordered_map
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
const int N=2e5+10,M=1,inf=0x3f3f3f3f,mod=1e9+7;
int n,a[N];
PII vis[N];
int gcfx()
{
	IOS;
	cin>>n;
	n*=2;
	int res=0;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++)
	{
		if(a[i])
		{
			int j;
			for(j=i+1;;j++)
			{
				if(a[j]!=a[i]&&a[j]!=0) res++;
				else if(a[i]==a[j]) break;
			}
			a[j]=0;
		}
	}
	cout<<res<<endl;
	return 0;
}

END