-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathMain.java
50 lines (39 loc) Β· 1.38 KB
/
Main.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
package Permutation.P10973;
import java.io.*;
import java.util.*;
public class Main {
static int N;
static int[] nums;
public static void main(String[] args) throws Exception {
System.setIn(new FileInputStream("src/Permutation/P10973/input.txt"));
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
N = Integer.parseInt(br.readLine());
nums = new int[N];
StringTokenizer st = new StringTokenizer(br.readLine());
for (int i = 0; i < N; i++) {
nums[i] = Integer.parseInt(st.nextToken());
}
int target = N-1;
while (target > 0 && nums[target] > nums[target-1]) target --;
if (target == 0) System.out.println(-1);
else {
boolean[] visited = new boolean[N+1];
for (int i = 0; i < target - 1; i++) {
visited[nums[i]] = true;
}
for (int i = nums[target-1] - 1; i > 0; i--) {
if (!visited[i]) {
nums[target-1] = i;
visited[i] = true;
break;
}
}
int idx = target;
for (int i = N; i > 0; i--) {
if (!visited[i]) nums[idx++] = i;
}
for (int i = 0; i < N; i++) System.out.print(nums[i] + " ");
System.out.println();
}
}
}