【题目】
给定数组,每个元素代表一个木头的长度,木头可以任意截断,从这堆木头中截出至少k个相同长度为m的木块,已知k,求max(m)
https://blog.csdn.net/gzy13269561397/article/details/50810882?utm_source=blogxgwz0
public class Main1{
public static void main(String[] args){
int[] a = {232,124,456};
int k = 7;
Arrays.sort(a);
int m = a[a.length-1];
for(int i=0;i<a.length;i++){
count = count + a[i]/m;
if(count>=k){
System.out.println(count);
return;
}else{
m--;
}
}
System.out.println(m);//114
}
}
public class Main{
public static void main(String[] args){
int[] L = {232,124,456};
int k = 7;
System.out.println(max_m(L,k));//114
}
//思路:找最大长度m,可能从某个数开始递减。最大长度max(m)<=数组中每个数除k之和。
//如:232/7 + 124/7 + 456/7 = 115, 但是从115开始递减是不够的,应该从最大值开始遍历。
//即:从Math.max(sum,数组元素最大值)开始递减
public static int max_m(int[] L, int k) {
int i = 0; int j = 0; int sum = 0; int max = 0; int max0 = 0; int t = 0;
if (L == null || L.length == 0) {
return 0;
}
int[] J = new int [L.length];
for (i = 0; i < L.length; i++) {
J[i] = L[i];
sum += L[i] / k;
}
for (i = 0; i < L.length - 1; i++) {
if (L[0] < L[i]) {
t = L[0];
L[0] = L[i];
L[i] = t;
}
}
max0 = Math.max(sum, L[0]);
for (max = max0; max >= 1; max--) {
sum = 0;
for (i = 0; i < L.length; i++) {
sum += J[i] / max;
}
if (sum >= k) {
break;
}
}
return max;
}
}