/
1062.cpp
49 lines (40 loc) · 1.09 KB
/
1062.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
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define pow2(i) (1<<i)
#define bit(i) (1<<i)
#define isOdd(i) (i&1)
#define isEven(i) (!(i&1))
#define sz(i) i.size()
#define REP(i, b, n) for (int i = b; i < n; i++)
#define REPI(i, b, n) for (int i = b; i <= n; i++)
#define rep(i, n) REP(i, 0, n)
#define repi(i, n) REPI(i, 0, n)
int main(void) {
string input;
int case_number = 0;
while (getline(cin, input)) {
if (input == "end") break;
vector< stack<char> > stacks;
rep (i, input.size()) {
bool found = false;
rep (j, stacks.size()) {
if (stacks[j].top() >= input[i]) {
found = true;
stacks[j].push(input[i]);
break;
}
}
if (!found) {
stack<char> tmp;
tmp.push(input[i]);
stacks.push_back(tmp);
}
}
case_number++;
cout << "Case " << case_number << ": " << stacks.size() << endl;
}
return 0;
}