关闭

nyoj cakes 1163 (排序) 水

146人阅读 评论(0) 收藏 举报
分类:

cakes

时间限制:1000 ms  |  内存限制:65535 KB
难度:0
描述
there are some naughty little cakes(less than 1000), each cake has a numberthey stand in plates whose number start from 0 increasing in turn . The process of waiting for being taste by small Q is very boring so they made a game .According to the serial numbers of the cake from small to large lying on a plate ,but they forgot the plates that they lying before, if they don't go back, small Q will be very angry.So, smart programmer monkey  can you help them?
输入
Multiple sets of test data
first give you a digsit the number of cakes;
then there are n digsits
输出
。。。
样例输入
4
4 2 1 3
5
4 3 1 2 5
样例输出
2 1 3 0
2 3 1 0 4
提示

maybe they are equal to others,if so ,printf the order before

题特别容易,就是题意太难理解(英语太渣)。

题意:

就是有n个数,把它们按升序排列后,再输出它们原本所处的位置的序号。

Hait:注意提示的内容。。。

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct zz
{
	int x;
	int y;
}q[1010];
int cmp(zz a,zz b)
{
	if(a.x==b.x)
		return a.y<b.y;
	return a.x<b.x;
}
int main()
{
	int n,i;
	while(scanf("%d",&n)!=EOF)
	{
		for(i=0;i<n;i++)
		{
			scanf("%d",&q[i].x);
			q[i].y=i;
		}
		sort(q,q+n,cmp);
		for(i=0;i<n-1;i++)
			printf("%d ",q[i].y);
			printf("%d\n",q[n-1].y); 
	}
	return 0;
} 


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:242806次
    • 积分:13156
    • 等级:
    • 排名:第1002名
    • 原创:1116篇
    • 转载:20篇
    • 译文:0篇
    • 评论:23条
    最新评论