-
Notifications
You must be signed in to change notification settings - Fork 0
/
1041.cpp
100 lines (89 loc) · 1.67 KB
/
1041.cpp
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include <algorithm>
#include <stdio.h>
using namespace std;
typedef struct node
{
int number;
int index;
}node;
bool less_than_number(const node &A, const node &B)
{
return A.number < B.number;
}
bool less_than_index(const node &A, const node &B)
{
return A.index < B.index;
}
bool equal_number(const node &A, const node &B)
{
return A.number == B.number;
}
#define MAX_PEOPLE 100005
node records[MAX_PEOPLE]; // 保存所有记录
node results[MAX_PEOPLE]; // 保存所有unique记录
int totalNum, uniqueNum;
void copy_unique()
{
node *pre, *cur, *next;
// 先处理掉三种特殊情况
if (0 == totalNum)
{
return ;
}
if (1 == totalNum)
{
results[uniqueNum++] = records[0];
return ;
}
if (2 == totalNum)
{
if (records[0].number != records[1].number)
{
results[uniqueNum++] = records[0];
results[uniqueNum++] = records[1];
}
return ;
}
// 通常情况(totalNum >= 3)
if (records[0].number != records[1].number)
{
results[uniqueNum++] = records[0];
}
for (int i = 1; i != totalNum-1; ++i)
{
pre = records + i - 1;
cur = records + i;
next = records + i + 1;
if (pre->number != cur->number && cur->number != next->number)
{
results[uniqueNum++] = *cur;
}
}
if (records[totalNum-2].number != records[totalNum-1].number)
{
results[uniqueNum++] = records[totalNum-1];
}
return ;
}
int main()
{
scanf("%d", &totalNum);
for (int i = 0; i != totalNum; ++i)
{
scanf("%d", &records[i].number);
records[i].index = i;
}
sort(records, records+totalNum, less_than_number);
copy_unique();
if (uniqueNum == 0)
{
printf("None\n");
}
else
{
sort(results, results+uniqueNum, less_than_index);
printf("%d\n", results[0]);
}
system("pause");
return 0;
}