-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDynamicProgramming_2.java
More file actions
64 lines (54 loc) · 1.24 KB
/
Copy pathDynamicProgramming_2.java
File metadata and controls
64 lines (54 loc) · 1.24 KB
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
package HuaweiCoding;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class DynamicProgramming_2 {
public static int getNeedValue(int[] array,int n) {
int[] dp=new int[n];
int[] dp2=new int[n];
int maxValue=0;
ArrayList<Integer> arrayList=new ArrayList<>();
for(int i=0;i<n;i++) {
arrayList.add(array[i]);
}
dp[0]=1;
for(int i=1;i<n;i++) {
dp[i]=1;
for(int j=0;j<i;j++) {
if(arrayList.get(j)<arrayList.get(i)
&& dp[j]>dp[i]-1) {
dp[i]=dp[j]+1;
}
}
}
Collections.reverse(arrayList);
dp2[0]=1;
for(int i=1;i<n;i++) {
dp2[i]=1;
for(int j=0;j<i;j++) {
if(arrayList.get(j)<arrayList.get(i)
&& dp2[j]>dp2[i]-1) {
dp2[i]=dp2[j]+1;
}
}
}
for(int i=0;i<n;i++) {
if(dp[i]+dp2[n-i-1]>maxValue) {
maxValue=dp[i]+dp2[n-i-1];
}
}
return n-maxValue+1;
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
while(sc.hasNext()) {
int n = sc.nextInt();
int[] array=new int[n];
for(int i=0;i<n;i++) {
array[i]=sc.nextInt();
}
int result = getNeedValue(array, n);
System.out.println(result);
}
}
}