forked from alec121212/AlgorithmsAndAbstractDesign
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProgram5B.java
More file actions
76 lines (69 loc) · 2.54 KB
/
Program5B.java
File metadata and controls
76 lines (69 loc) · 2.54 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
65
66
67
68
69
70
71
72
73
74
75
76
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
class Program5B {
public record Result(int numPlatforms, int totalHeight, int[] numPaintings) {}
/**
* Solution to program 5B
*
* @param n number of paintings
* @param w width of the platform
* @param heights array of heights of the paintings
* @param widths array of widths of the paintings
* @return Result object containing the number of platforms, total height of the paintings,
* and the number of paintings on each platform
*/
private static Result program5B(int n, int w, int[] heights, int[] widths) {
int[] minHeight = new int[n + 1];
int[] split = new int[n + 1];
minHeight[0] = 0;
for (int i = 1; i <= n; i++) {
minHeight[i] = Integer.MAX_VALUE;
int totalWidth = 0;
int maxHeight = 0;
for (int j = i; j >= 1; j--) {
totalWidth += widths[j - 1];
maxHeight = Math.max(maxHeight, heights[j - 1]);
if (totalWidth <= w) {
int totalHeight = minHeight[j - 1] + maxHeight;
if (totalHeight < minHeight[i]) {
minHeight[i] = totalHeight;
split[i] = j - 1;
}
} else {
break;
}
}
}
// Reconstruct the number of paintings on each platform
List<Integer> paintings = new ArrayList<>();
int index = n;
while (index > 0) {
int start = split[index];
paintings.add(0, index - start);
index = start;
}
int numPlatforms = paintings.size();
return new Result(numPlatforms, minHeight[n], paintings.stream().mapToInt(i -> i).toArray());
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int W = sc.nextInt();
int[] heights = new int[n];
int[] widths = new int[n];
for (int i = 0; i < n; i++) {
heights[i] = sc.nextInt();
}
for (int i = 0; i < n; i++) {
widths[i] = sc.nextInt();
}
sc.close();
Result result = program5B(n, W, heights, widths);
System.out.println(result.numPlatforms());
System.out.println(result.totalHeight());
for (int i = 0; i < result.numPaintings().length; i++) {
System.out.println(result.numPaintings()[i]);
}
}
}