FilesExpand file tree

 master

/

1178_2.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

59 lines (42 loc) · 818 Bytes

 master

/

1178_2.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

59 lines (42 loc) · 818 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include <iostream>

#include <cstdlib>

#include <string>

#include <vector>

#include <algorithm>

#include <queue>

#include <list>

#include <stack>

#include <map>

#include <set>

using namespace std;

const int MAXN = 150000;

int turn[MAXN], N;

int mymap[MAXN];

void work(){

vector<int> empty;

for(int i=1; i<=N; i++){

mymap[turn[i] ] += 1;

}

for(int i=1; i<=N; i++){

if(mymap[i]>=2){

for(int j=1; j<=N; j++){

if(turn[j] == i){

cout<<j<<endl;

return ;

}

}

}

}

}

int main(){

cin>>N;

for(int i=1; i<=N; i++){

cin>>turn[i];

if(turn[i] == 1){

cout<<i<<endl;

return 0;

}

}

work();

return 0;

}