forked from bamsarts/DS-ALGO
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Sortedright.java
68 lines (65 loc) · 1.44 KB
/
Sortedright.java
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
64
65
66
67
68
import java.util.*;
class Solution
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a[]=new int[n];
int b[]=new int[n];
int c[]=new int[n];
for(int i=0;i<n;i++)
{
a[i]=sc.nextInt();
b[i]=a[i];
}
Arrays.sort(b);
int count=0,k=0,l=0,r=0,t=0;
for(int i=0;i<n;i++)
{
if(a[i]!=b[i])
{
c[k]=a[i];
k++;
count++;
if(count==1)
{
l=i+1;
}
else if(count==2)
{
r=i+1;
}
else
{
t=i+1;
}
}
}
if(count==2)
{
System.out.println("yes");
System.out.println("swap "+l+" "+r);
}
else
{
int count2=0;
for(int i=k-1;i>0;i--)
{
if(c[i]<c[i-1])
{
count2++;
}
}
if(count2==(k-1))
{
System.out.println("yes");
System.out.println("reverse "+l+" "+t);
}
else
{
System.out.println("no");
}
}
}
}