@@ -13,8 +13,8 @@ bool ok(int i)
13
13
int N;
14
14
int ans ()
15
15
{
16
- int i = (N + 1 ) / 2 ;cout<<i<< " ::i's value " ;
17
- int j = (N + 2 ) / 2 ;cout<<j<< " ::j's value " ;
16
+ int i = (N + 1 ) / 2 ;
17
+ int j = (N + 2 ) / 2 ;
18
18
int id = 0 ;
19
19
D1[id] = N + 2 ;
20
20
D2[id] = N + 2 ;
@@ -27,12 +27,10 @@ int ans()
27
27
{
28
28
if (ok (i))
29
29
D1[id] = 0 ;
30
- cout<<A[i]<<" ::A[i]'s value" <<A[j]<<" ::A[j]'s value" ;
31
30
swap (A[i], A[j]);
32
31
if (ok (i))
33
32
D2[id] = 1 ;
34
33
swap (A[i], A[j]);
35
- cout<<D1[id]<<" 1id" <<" " <<D2[id]<<" 2id" ;
36
34
}
37
35
while (true )
38
36
{
@@ -44,20 +42,28 @@ int ans()
44
42
D1[id] = N + 2 ;
45
43
D2[id] = N + 2 ;
46
44
{
47
- if (ok (i) && ok (j - 1 ))
45
+ if (ok (i) && ok (j - 1 )){
48
46
D1[id] = min (D1[id], D1[id - 1 ]);
47
+ // cout<<"Value D1 "<<D1[id]<<i<<" "<<j<<endl;
48
+ }
49
49
swap (A[i + 1 ], A[j - 1 ]);
50
- if (ok (i) && ok (j - 1 ))
50
+ if (ok (i) && ok (j - 1 )){
51
51
D1[id] = min (D1[id], D2[id - 1 ]);
52
+ // cout<<"Value D1 "<<D1[id]<<i<<" "<<j<<endl;
53
+ }
52
54
swap (A[i + 1 ], A[j - 1 ]);
53
55
}
54
56
swap (A[i], A[j]);
55
57
{
56
- if (ok (i) && ok (j - 1 ))
58
+ if (ok (i) && ok (j - 1 )){
57
59
D2[id] = min (D2[id], 1 + D1[id - 1 ]);
60
+ // cout<<"Value D2 "<<D2[id]<<i<<" "<<j<<endl;
61
+ }
58
62
swap (A[i + 1 ], A[j - 1 ]);
59
- if (ok (i) && ok (j - 1 ))
63
+ if (ok (i) && ok (j - 1 )){
60
64
D2[id] = min (D2[id], 1 + D2[id - 1 ]);
65
+ // cout<<"Value D2 "<<D2[id]<<i<<" "<<j<<endl;
66
+ }
61
67
swap (A[i + 1 ], A[j - 1 ]);
62
68
}
63
69
swap (A[i], A[j]);
0 commit comments