40:Distinct

40:Distinct

总时间限制: 

1000ms

内存限制: 

65536kB

描述

Select some of N values. The selected values are all different and the number of the selected values is maximum.

输入

First line: one positive integers N (N <= 100).
Second line: N positive integers (<= 10000).

输出

One line contains several selected values.

样例输入

7
2 2 5 1 2 1 7

样例输出

2 5 1 7

• 查看
• 提交
• 统计
• 提问

• #include<cstdio>
  #include<iostream>
  using namespace std;
  int a[10005]={0};//元素a[i]=0表示值i在之前没有出现过
  int main(){
  	int n;
  	cin>>n;
  	for(int i=1;i<=n;i++){
  		int m;
  		cin>>m;
  		if(!a[m]){//判断m是否在之前出现过
  			cout<<m<<' ';
  			a[m]++;//a[m]!=0为后面相同值m出现做下一次判断
  		} 
  	}
  }