-
Notifications
You must be signed in to change notification settings - Fork 0
/
1346.cpp
82 lines (68 loc) · 1.56 KB
/
1346.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
#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <deque>
using namespace std;
enum ELastOp {
None = 0,
More = 1,
Less = 2,
Eq = 3,
Any = 4
};
ELastOp Compare(ELastOp lastOp, int prev, int cur, vector<int>& add, vector<int>& old) {
if (prev == cur) {
int val = min(add.back(), old.back()) + 1;
add.push_back(val);
old.push_back(val);
return ELastOp::Eq;
}
ELastOp op = ELastOp::None;
if (prev < cur) {
op = ELastOp::More;
} else {
op = ELastOp::Less;
}
int newAdd = min(add.back(), old.back()) + 1;
bool acceptable = lastOp == op || lastOp == ELastOp::None;
int newOld = min(add.back(), old.back() + int(!acceptable));
add.push_back(newAdd);
old.push_back(newOld);
return op;
}
int main() {
int l, r;
cin >> l >> r;
int n = r - l + 1;
vector<int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (a.empty() || x != a.back())
a.push_back(x);
}
int cnt = 0;
ELastOp lastOp = ELastOp::None;
vector<int> add, old;
add.push_back(1);
old.push_back(1);
for (int i = 1; i < a.size(); i++) {
lastOp = Compare(lastOp, a[i - 1], a[i], add, old);
}
/*
for (int x : add) {
cout << x << " ";
}
cout << endl;
for (int x : old) {
cout << x << " ";
}
cout << endl; */
cout << min(old.back(), add.back()) << endl;
return 0;
}