blob: 8f52f5dcfb71632be58a8cad458ae8ebf3c53471 (
plain)
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
|
#include <string>
#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
bool isValid( const std::vector<int> & permu , const std::vector<int> & the_is ,
const std::vector<int> & the_ds ) {
for ( int i = 0 ; i < the_is.size( ) ; i++ ) {
int pos = the_is[ i ] ;
if ( permu[pos] >= permu[ pos + 1] ) {
return false ;
}
}
for ( int i = 0 ; i < the_ds.size( ) ; i++ ) {
int pos = the_ds[ i ] ;
if ( permu[pos] <= permu[ pos + 1 ] ) {
return false ;
}
}
return true ;
}
int main( ) {
std::cout << "Please enter a string consisting of capital I and D only!\n" ;
std::string line ;
std::cin >> line ;
std::vector<int> ipositions ;
std::vector<int> dpositions ;
for ( int i = 0 ; i < line.length( ) ; i++ ) {
if ( line.substr( i , 1 ) == "I" )
ipositions.push_back( i ) ;
else
dpositions.push_back( i ) ;
}
int len = line.length( ) ;
std::vector<int> numbers ( len + 1 ) ;
std::iota( numbers.begin( ) , numbers.end( ) , 0 ) ;
std::vector<int> result ;
if ( dpositions.empty( ) ) {
result = numbers ;
}
else {
if ( ipositions.empty( ) ) {
result = numbers ;
std::reverse( result.begin( ) , result.end( ) ) ;
}
else {
while ( std::next_permutation( numbers.begin( ) , numbers.end( ) ) ) {
if ( isValid( numbers, ipositions, dpositions ) ) {
result = numbers ;
break ;
}
}
}
}
std::cout << "( " ;
for ( int i : result ) {
std::cout << i << " " ;
}
std::cout << " )\n" ;
return 0 ;
}
|
