Codeforces Round #481 (Div. 3) A. Remove Duplicates

A. Remove Duplicates
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Petya has an array aa consisting of nn integers. He wants to remove duplicate (equal) elements.

Petya wants to leave only the rightmost entry (occurrence) for each element of the array. The relative order of the remaining unique elements should not be changed.

Input

The first line contains a single integer nn (1n501≤n≤50) — the number of elements in Petya's array.

The following line contains a sequence a1,a2,,ana1,a2,…,an (1ai10001≤ai≤1000) — the Petya's array.

Output

In the first line print integer xx — the number of elements which will be left in Petya's array after he removed the duplicates.

In the second line print xx integers separated with a space — Petya's array after he removed the duplicates. For each unique element only the rightmost entry should be left.

Examples
input
Copy
6
1 5 5 1 6 1
output
Copy
3
5 6 1 
input
Copy
5
2 4 2 4 4
output
Copy
2
2 4 
input
Copy
5
6 6 6 6 6
output
Copy
1
6 
Note

In the first example you should remove two integers 11, which are in the positions 11 and 44. Also you should remove the integer 55, which is in the position 22.

In the second example you should remove integer 22, which is in the position 11, and two integers 44, which are in the positions 22 and 44.

In the third example you should remove four integers 66, which are in the positions 112233 and 44


题意:给你一个数组,删去重复的数字,保留最右边的一个。

题解:数字范围1000,用一个1000的数组存每个数出现的次数,然后遍历一遍原数组,出现一次a[i]--,当a[i]==1时输出那个数,也就是最右边的数

代码:

#include <iostream>
#include <cstring>
using namespace std;
int  n;
int a[1100];
int b[100];
int main()
{
	cin>>n;
	memset(a,0,sizeof(a));
	for(int i=0;i<n;i++)
	{
		cin>>b[i];
		a[b[i]]++;
	}
	int p=0;
	for(int i=0;i<1010;i++)
	{
		if(a[i])
			p++;
	}
	cout<<p<<endl;
	for(int i=0;i<n;i++)
	{
		if(a[b[i]]==1)
			cout<<b[i]<<" ";
		else if(a[b[i]]>1)
			a[b[i]]--;
	}
}

阅读更多
想对作者说点什么?

博主推荐

换一批

没有更多推荐了,返回首页