-
Notifications
You must be signed in to change notification settings - Fork 0
/
UVA_00120.cpp
62 lines (53 loc) · 1.49 KB
/
UVA_00120.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
#include <iostream>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <sstream>
using namespace std;
int main(void)
{
int n, i, j, cnt, loc;
string input, mid;
while(getline(cin, input))
{
cnt = 0;
cout << input << "\n";
vector <int> stored, sorted;
map <int, int> pos;
stringstream proc(input);
while(getline(proc, mid, ' '))
{
stringstream num(mid);
num >> n;
stored.push_back(n);
sorted.push_back(n);
pos[n] = cnt++;
}
sort(sorted.begin(), sorted.end());
for(i = cnt-1; i > 0; i--)
if(sorted[i] != stored[i])
{
if(pos[sorted[i]] != 0)
{
cout << cnt - pos[sorted[i]] << " ";
loc = pos[sorted[i]];
for(j = 0; 2*j < loc; j++)
{
swap(stored[j], stored[loc-j]);
pos[stored[j]] = j;
pos[stored[loc-j]] = loc-j;
}
}
cout << cnt - i << " ";
for(j = 0; 2*j < i; j++)
{
swap(stored[j], stored[i-j]);
pos[stored[j]] = j;
pos[stored[i-j]] = i-j;
}
}
cout << "0\n";
}
return 0;
}