提出

src/apple.c

@@ -4,14 +4,57 @@ int n;
 int k;
 int A[100000];
 
+int arrayMax(int a[], int n){
+    int max = 0;
+    for(int i = 0; i < n; i++){
+        if(max < a[i]){
+            max = a[i];
+        }
+    }
+    return max;
+}
 
-int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
-    scanf("%d", &A[i]);
-  }
+unsigned int  binary_search(int A[], int k, int n){
+	int lb = 1;
+    int ub = arrayMax(A, n);
+	int sum = 0;
+    while(ub -lb > 1){
+    	sum = 0;
+    	int mid = (lb + ub) / 2;
+    	for(int i = 0; i < n; i++){
+        	sum = sum + (A[i] + mid - 1) / mid;
+    	}
+  		if(sum > k){
+  			lb = mid;
+  		}
+  		else if(sum <= k){
+  			ub = mid;
+  		}
+    }
+	sum = 0;
+	for(int i = 0; i < n; i++){
+        	sum = sum + (A[i] + lb - 1) / lb;
+	}
+	if(sum > k){
+  		return ub;
+  	} 
+    else {
+  		return lb;
+  	}
+	return 0;
+}
 
+int main(){
+    int i;
+    scanf("%d%d", &n, &k);
+    for(i = 0; i < n; i++){
+      scanf("%d", &A[i]);
+    }
+	int result = binary_search(A, k, n);
+	printf("結果=%d\n", result);
 
-  return 0;
+    return 0;
 }
+
+
+

src/array.c

@@ -4,15 +4,28 @@ int n;
 int k;
 int A[100000];
 
+unsigned int binary_search(int A[], int x, int n){
+  int lb = -1;
+  int ub = n;
+  while(ub - lb > 1){
+    int mid = (lb + ub) / 2;
+    if(A[mid] >= x) ub = mid;
+    else lb = mid;
+  }
+  return ub;
+}
 
 int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
-    scanf("%d", &A[i]);
-  }
+	int i, ub;
+ 	scanf("%d%d", &n, &k);
+	for(i = 0; i < n; i++){
+    	scanf("%d", &A[i]);
+    }
 
+	ub = binary_search(A, k, n);
+
+	printf("%d\n", ub);
+	return 0;
+}
 
 
-  return 0;
-}

src/spear.c

@@ -4,14 +4,54 @@ int n;
 int k;
 int A[100000];
 
+int arrayMax(int a[], int n){
+    int max = 0;
+    for(int i = 0; i < n; i++){
+        if(max < a[i]){
+            max = a[i];
+        }
+    }
+    return max;
+}
 
+unsigned int  binary_search(int A[], int k, int n){
+	int sma = 0;
+    int big = arrayMax(A, n);
+	int sum = 0;
+    while(big - sma > 1){
+    	sum = 0;
+    	int mid = (big + sma) / 2;
+    	for(int i = 0; i < n; i++){
+        	sum = sum + A[i] / mid;
+    	}
+  		if(sum >= k){
+  			sma = mid;
+  		}
+  		else if(sum < k){
+  			big = mid;
+  		}
+    }
+	sum = 0;
+	for(int i = 0; i < n; i++){
+        	sum = sum + A[i] / big;
+	}
+	if(sum == k){
+  		return big;
+  	} 
+    else {
+  		return sma;
+  	}
+	return 0;
+}
 int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
-    scanf("%d", &A[i]);
-  }
+    int i;
+    scanf("%d%d", &n, &k);
+    for(i = 0; i < n; i++){
+      scanf("%d", &A[i]);
+    }
+	int result = binary_search(A, k, n);
+	printf("結果=%d\n", result);
 
+    return 0;
 
-  return 0;
 }

src/works.c

@@ -4,14 +4,74 @@ int n;
 int k;
 int A[100000];
 
+int sumarray(int a[], int n){
+    int sum = 0;
+    for(int i = 0; i < n; i++){
+    	sum = sum + a[i];
+    }
+    return sum;
+}
+
+
 
+unsigned int  binary_search(int A[], int k, int n){
+	int sma = 1;
+	int big = sumarray(A, n);
+	int mid = 0;
+	int nin;
+	int chk;
+	int midmid=0;
+	int max;
+
+	while(big - sma > 1){
+    	mid = (big + sma) / 2;
+		nin = 1;
+		chk = 0;
+		max = 0;
+		for(int i = 0; i < n; i++){
+			if(A[i]>mid){
+				nin=0;
+				break;
+			}
+			if(max<chk){
+				max=chk;
+			}
+			chk = chk + A[i];
+			if(chk > mid){
+				nin++;
+				chk = A[i];
+				if(i==(n-1) && max<chk){
+					max=chk;
+				}
+			}else if(i==(n-1)){
+				if(max<chk){
+					max=chk;
+				}
+			}
+		}
+		if(nin==0){
+			sma = mid;
+		}else if(nin < k){
+			big = mid;
+			midmid = max;
+		}else if(nin == k){
+			big = mid;
+			midmid = max;
+		}else{
+			sma = mid;
+		}
+    }	
+	return midmid;    	
+}
 int main(){
-  int i, lb, ub;
-  scanf("%d%d", &n, &k);
-  for(i = 0; i < n; i++){
-    scanf("%d", &A[i]);
-  }
+    int i;
+    scanf("%d%d", &n, &k);
+    for(i = 0; i < n; i++){
+      scanf("%d", &A[i]);
+    }
+	int result = binary_search(A, k, n);
+	printf("結果=%d\n", result);
 
+    return 0;
 
-  return 0;
 }