-
Notifications
You must be signed in to change notification settings - Fork 0
/
uva120.cpp
59 lines (53 loc) · 1.12 KB
/
uva120.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
#include <iostream>
#include <string.h>
#include <sstream>
using namespace std;
void flip(int pancakes[], int totalPancakes, int index)
{
for (int i = 0; i <= index / 2; ++i)
{
swap(pancakes[i], pancakes[index - i]);
}
printf("%d ", totalPancakes - index);
}
int main()
{
string input_str;
while (getline(cin, input_str))
{
cout << input_str << endl;
stringstream ss(input_str);
//init
int pancakes[35] = {0};
int totalPancakes = 0;
while (ss >> pancakes[totalPancakes])
{
++totalPancakes;
}
//start compute
int indexOfMax = 0;
//設定找最大值的範圍
for (int i = totalPancakes - 1; i > 0; --i)
{
indexOfMax = 0;
//找此範圍內的最大值
for (int j = 0; j <= i; ++j)
{
if (pancakes[indexOfMax] < pancakes[j])
indexOfMax = j;
}
//indexOfMax 不在最右邊
if (indexOfMax < i)
{
//flip indexOfMax to 最左邊
if (indexOfMax != 0)
{
flip(pancakes, totalPancakes, indexOfMax);
}
//flip indexOfMax to 最右邊
flip(pancakes, totalPancakes, i);
}
}
printf("0\n");
}
}