B. Vlad and Cafes
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Vlad likes to eat in cafes very much. During his life, he has visited cafes n times. Unfortunately, Vlad started to feel that his last visits are not any different from each other. To fix that Vlad had a small research.
First of all, Vlad assigned individual indices to all cafes. Then, he wrote down indices of cafes he visited in a row, in order of visiting them. Now, Vlad wants to find such a cafe that his last visit to that cafe was before his last visits to every other cafe. In other words, he wants to find such a cafe that he hasn't been there for as long as possible. Help Vlad to find that cafe.
Input
In first line there is one integer n (1 ≤ n ≤ 2·105) — number of cafes indices written by Vlad.
In second line, n numbers a1, a2, ..., an (0 ≤ ai ≤ 2·105) are written — indices of cafes in order of being visited by Vlad. Vlad could visit some cafes more than once. Note that in numeration, some indices could be omitted.
Output
Print one integer — index of the cafe that Vlad hasn't visited for as long as possible.
Examples
Input
Copy
5 1 3 2 1 2
Output
Copy
3
Input
Copy
6 2 1 2 2 4 1
Output
Copy
2
Note
In first test, there are three cafes, and the last visits to cafes with indices 1 and 2 were after the last visit to cafe with index 3; so this cafe is the answer.
In second test case, there are also three cafes, but with indices 1, 2 and 4. Cafes with indices 1 and 4 were visited after the last visit of cafe with index 2, so the answer is 2. Note that Vlad could omit some numbers while numerating the cafes.
题目链接：http://codeforces.com/contest/890/problem/B
题意：给出一个人n次去咖啡厅的号码，求出最长时间没去的咖啡厅号码。思维题，记录所有去过的咖啡厅的最新时间，时间最小的就是长时间没去的咖啡厅。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 2*1e5 + 5;
int hs[maxn];
int main()
{
int n;
while(~scanf("%d", &n))
{
memset(hs, 0, sizeof hs);
if(n == 0)
break;
int max_n = 0;
for(int i = 1; i <= n; i++)
{
int x;
cin >> x;
hs[x] = i;
max_n = max(max_n, x);
}
int index;
int min_x = 0x3f3f3f3f;
for(int i = 0; i <= max_n; i++)
{
if(min_x >= hs[i] && hs[i])
{
index = i;
min_x = hs[i];
}
}
cout << index << endl;
return 0;
}
}