algorithm/2613.cpp at main · JooHui-void/algorithm · GitHub

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
#include <stdio.h>
int marble[300];
int num,cut;
int divide(int x){
	int cnt = 1;
	int sum=0;
	for(int i=0;i<num;i++){
		if(marble[i]+sum>x){
			cnt++;
			sum = marble[i];
		}else{
			sum+=marble[i];
		}
	}

	return cnt;
}

int main(){
	int Max = 0;
	int max = 0;
	scanf("%d %d",&num,&cut);
	for(int i=0;i<num;i++){
		scanf("%d",&marble[i]);
		Max+=marble[i];
		if(max<marble[i]){
			max = marble[i];
		}
	}

	int start = max,end = Max;

	while(start<=end){
		int mid = (start+end)/2;
		int div = divide(mid);
		if(div>cut){
			start = mid+1;
		}else{
			end = mid-1;
		}

	}
	printf("%d\n",start);
	int sum =0;
	int cnt = 0;
	for(int i=0;i<num;i++){
//		printf("%d : %d\n",cut,num-i);
		if(sum+marble[i]>start){
			sum=marble[i];
			printf("%d ",cnt);
			cut--;
			cnt = 1;
		}else if(cut==num+1-i){
			sum=marble[i];
			printf("%d ",cnt);
			cut--;
			cnt = 1;
		}else{
			sum+=marble[i];
			cnt++;
		}
	}
	printf("%d",cnt);
}