-
Notifications
You must be signed in to change notification settings - Fork 21
/
Copy path1454B.java
78 lines (69 loc) · 2.07 KB
/
1454B.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
//https://codeforces.com/contest/1454/problem/B
import java.io.*;
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
// import java.util.Scanner;
import java.util.StringTokenizer;
public class test {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
public static void main(String[] args) {
FastReader s = new FastReader();
long t = s.nextLong();
while (t-- != 0) {
int n = s.nextInt();
int a[] = new int[n]; //array
int v[] = new int[n + 1]; //frequency array
int min = (int) 1e9;
int ans = -1;
for (int i = 0; i < n; i++) {
a[i] = s.nextInt();
v[a[i]]++;
}
for (int i = 0; i < n; i++) {
if (v[a[i]] == 1) {
if(min>a[i]){
ans=i+1;
min = a[i];
}
}
}
System.out.println(ans);
}
}
}