-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathArray4.java
More file actions
184 lines (173 loc) · 3.61 KB
/
Array4.java
File metadata and controls
184 lines (173 loc) · 3.61 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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
package array;
public class Array4 {
// 查找最长递增子序列。
static void searchMaxIncSubArray(int p[], int length) {
int[] maxValue = new int[length + 1];
maxValue[1] = p[0];
int k = 1;
for (int i = 1; i < length; i++) {
if (p[i] > maxValue[k]) {
k++;
maxValue[k] = p[i];
} else if (p[i] == maxValue[k]) {
continue;
} else {
if (p[i] < maxValue[1]) {
maxValue[1] = p[i];
continue;
}
int first = 1;
int last = k;
// 二分查找
while (first < last) {
int mid = (last + first) / 2;
if (maxValue[mid] <= p[i]) {
first = mid + 1;
} else {
last = mid;
}
}
if (p[i] < maxValue[first]) {
maxValue[first] = p[i];
}
}
}
System.out.println("k = " + k);
}
//区间辅助类
static class Area {
int start;
int end;
Area(int start, int end) {
this.start = start;
this.end = end;
}
}
//区间排序
public static void sortArea(Area areas[], int start, int end) {
if (areas == null) {
return;
}
if (start < end) {
int i = start + 1;
int j = end;
Area temp = null;
while (i <= j) {
while (i <= j && areas[i].start < areas[start].start) {
i++;
}
while (i <= j && areas[j].start > areas[start].start) {
j--;
}
if (i <= j) {
temp = areas[i];
areas[i] = areas[j];
areas[j] = temp;
}
}
temp = areas[start];
areas[start] = areas[j];
areas[j] = temp;
sortArea(areas, start, j - 1);
sortArea(areas, j + 1, end);
}
}
//合并区间
public static int mergeArea(Area areas[]) {
if (areas == null) {
return 0;
}
int index = 0;
Area lastArea = areas[0];
for (int i = 1; i < areas.length; i++) {
if (areas[i].start <= lastArea.end) {
if (areas[i].end >= lastArea.end) {
lastArea.end = areas[i].end;
areas[index] = lastArea;
}
} else {
lastArea = areas[i];
index++;
areas[index] = lastArea;
}
}
return index + 1;
}
//搜索区间是否在范围内
public static boolean searchArea(Area areas[], Area area) {
if (areas == null || area == null) {
return false;
}
int start = 0;
int end = areas.length - 1;
int mid = 0;
while (start <= end) {
mid = (start + end) / 2;
if (areas[mid].start > area.start) {
if (areas[mid].end < area.end) {
return false;
} else {
end = mid - 1;
}
} else if (areas[mid].start <= area.start && areas[mid].start <= area.end) {
if (areas[mid].end >= area.end) {
return true;
} else {
return false;
}
} else {
start = mid + 1;
}
}
return false;
}
//寻找是否有分割数组的最大值m ，使各份的和相等
public static boolean find(int p[], int flag[], int cursum, int groupSum, int id, int groupLen) {
if (p == null || flag == null) {
return false;
}
if (cursum < 0) {
return false;
} else if (cursum == 0) {
id++;
cursum = groupSum;
if (groupLen < id) {
return true;
}
}
for (int i = 0; i < p.length; i++) {
if (flag[i] != 0) {
continue;
}
flag[i] = id;
if (find(p, flag, cursum - p[i], groupSum, id, groupLen)) {
return true;
}
flag[i] = 0;
}
return false;
}
//一个整数数组，长度为 n，将其分为 m 份，使各份的和相等，求 m 的最大值
public static void maxGroup(int p[]) {
if (p == null) {
return;
}
int flag[] = new int[p.length];
int sum = 0;
int groupSum;
for (int i = 0; i < p.length; i++) {
sum += p[i];
}
for (int i = p.length; i >= 2; i--) {
if (sum % i != 0) {
continue;
}
groupSum = sum / i;
if (find(p, flag, groupSum, groupSum, 1, i)) {
for (int j = 0; j < p.length; j++) {
System.out.println(flag[j]);
}
}
}
}
}