hrbust 1739
来源:互联网 发布:c语言 匈牙利 编辑:程序博客网 时间:2024/05/24 06:29
把sort排序出的数组存储起来然后一一比对,位置不符合的就说明发生了jiao'huan
Sort ProblemTime Limit: 1000 MSMemory Limit: 65535 KTotal Submit: 343(88 users)Total Accepted: 182(86 users)Rating: Special Judge: YesDescription
You have a sequence of N (1 <= N <= 10 000) numbers (none of the numbers is equal to others), can you let the sequence become ascending within N movements.
InputThere are multiple test cases. The first line is a positive integer T, indicating the number of test cases.
For each test case:
Line 1. A positive integer N.
Line 2. This line contains N integers: a1, a2, ..., ai, ...,an (0 < ai <= 2 000 000 000) separated by space.
For each test case, output m at the first line. m is the times of operation.
Then m lines follows. Each line consists two integer x, y meaning that you will change the number on position x and the number on position y.
332 3 151 2 5 3 41011 3 17 19 7 2 20 15 10 13
Sample Output21 32 323 44 571 63 54 95 66 107 88 10
Source哈理工2013春季校赛 - 现场赛#include<stdio.h>#include<string>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
int a[100003],b[100003];
int vis[100003];
int t;
int cu_zu[100003][2];
int main()
{
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{scanf("%d",&a[i]);
b[i]=a[i];
}int z=0;
sort(b+1,b+n+1);
for(int i=1;i<=n;i++)
{
if(a[i]!=b[i])
{
for(int j=i+1;j<=n;j++)
{
if(b[i]==a[j])
{
int t=a[j];
a[j]=a[i];
a[i]=t;
cu_zu[z][0]=i;
cu_zu[z++][1]=j;
}
}
}
}
printf("%d\n",z);
for(int i=0;i<z;i++)
{
printf("%d %d\n",cu_zu[i][0],cu_zu[i][1]);
}
}
}
0 0
- hrbust 1739
- HRBUST
- HRBUST
- HRBUST
- HRBUST
- HRBUST
- HRBUST
- HRBUST
- Hrbust
- HRBUST
- HRBUST
- HRBUST
- HRBUST
- HRBUST
- HRBUST
- hrbust 1739 Sort Problem 模拟
- Hrbust 1073
- HRBUST 2250
- 2分钟教你在eclipse上搭建maven项目
- 蓝桥杯基础练习——十六进制转八进制
- 2016年中国互联网企业排名100强
- Validate Binary Search Tree
- 2012上机二 约瑟夫环
- hrbust 1739
- 从按下键盘到屏幕上显示字符计算机经过了哪些过程
- POJ 2299 Ultra-QuickSort 树状数组
- Android开发-如何去掉一个页面的标题栏和状态栏
- Poj 2387 单源最短路径
- mybatis ForEach Collection集合等规范解析(转)
- [LNMPA搭建四]Apache详细安装步骤
- 伸展树(splay)
- python中的setattr的使用