-
Notifications
You must be signed in to change notification settings - Fork 0
/
1051.cpp
70 lines (65 loc) · 1.14 KB
/
1051.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
#include <iostream>
#include <stack>
#include <vector>
#include <cstdio>
using namespace std;
int main(int argc, char const *argv[])
{
int m, n, k;
cin >> m >> n >> k;
for(int i = 0; i < k; ++i) {
stack<int> s1;
stack<int> s2;
vector<int> v;
int now;
for(int j = n; j > 0; --j){
scanf("%d", &now);
v.push_back(now);
s2.push(j);
}
bool posible = true;
for(int j = 0; j < n; ++j){
if(false == posible)
break;
if(s1.empty() || s1.top() < v[j]) {
while(true) {
// cout << "here 1" << endl;
if(s2.empty() || s2.top() > v[j]) {
// cout << s2.top() << " " << v[j] << endl;
posible = false;
// cout << "here 3" << endl;
break;
}
s1.push(s2.top());
// cout << s2.top() << endl;
s2.pop();
if(s1.top() == v[j]) {
// cout << "here 2" << endl;
break;
}
}
if(s1.size() > m) {
posible = false;
}
else {
s1.pop();
}
}
else {
if(s1.top() == v[j]) {
s1.pop();
}
else {
posible = false;
}
}
}
if(posible) {
cout << "YES" << endl;
}
else {
cout << "NO" << endl;
}
}
return 0;
}