Codeforces Round #277.5 (Div. 2) A

来源：互联网发布：网络病毒的传播途径编辑：程序博客网时间：2024/06/11 09:03

题目链接：http://codeforces.com/contest/489/problem/A

总感觉这种题目很不擅长。。。

容易晕。。

/* * ThinkingLion.cpp * *  Created on: 2014年10月2日 *      Author: dell */#include<stdio.h>#include<iostream>#include<string>#include<string.h>#include<algorithm>#include<iomanip>#include<vector>#include<time.h>#include<queue>#include<stack>#include<iterator>#include<math.h>#include<stdlib.h>#include<map>#include<limits.h>#define eps 1e-8#define INF 0x7fffffff#define FOR(i,a) for((i)=0;i<(a);(i)++)#define MEM(a) (memset((a),0,sizeof(a)))#define sfs(a) scanf("%s",a)#define sf(a) scanf("%d",&a)#define sfI(a) scanf("%I64d",&a)#define pf(a) printf("%d\n",a)#define pfI(a) printf("%I64d\n",a)#define pfs(a) printf("%s\n",a)#define sfd(a,b) scanf("%d%d",&a,&b)#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)#define for1(i,a,b) for(int i=(a);i<b;i++)#define for2(i,a,b) for(int i=(a);i<=b;i++)#define for3(i,a,b)for(int i=(b);i>=a;i--)#define MEM1(a) memset(a,0,sizeof(a))#define MEM2(a) memset(a,-1,sizeof(a))const double PI=acos(-1.0);template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}template<class T> inline T Min(T a,T b){return a<b?a:b;}template<class T> inline T Max(T a,T b){return a>b?a:b;}using namespace std;#define N 100005#define maxn 220#define ll __int64int n,k;int a[3100],c[3100];map<int,int> mp;struct Node{int id;int val;bool operator < (const Node &x) const{return val<x.val;}}b[3100];int main(){#ifndef ONLINE_JUDGEfreopen("in.txt","r",stdin);//freopen("out.txt","w",stdout);#endifwhile(scanf("%d",&n)!=EOF){for(int i=0;i<n;i++){sf(b[i].val);b[i].id=i;}sort(b,b+n);for(int i=0;i<n;i++){a[i]=b[i].id;//排名第i位的在元数组中排第a[i]位c[b[i].id] = i;//在原数组中位于第i的排名为c[i]位//printf("%d ",a[i]);}//printf("\n");printf("%d\n",n);for(int i=0;i<n;i++){printf("%d %d\n",i,a[i]);//将a[i]移动到其应该在的地方(i) a[c[i]]=a[i];//i位置与a[i]位置交换后，更新i位置处的位置 c[a[i]] = c[i];//i位置与a[i]位置交换后，更新i位置处的排名} }return 0;}

0 0