path: root / Year 2 / Design and analysis of algorithms / Practicum / Exam1 / 3-Popcorn.cpp


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

#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int K = 0, N = 0, S = 1;
	scanf("%d %d %d", &N, &K, &S);
	vector<int> p;
	int temp = 0;
	for (int i = 0; i < N; i++) {
		scanf("%d", &temp);
		p.push_back(temp);
	}

	for (int i = 0; i < p.size(); i++) {
		p[i] = p[i] / S + (p[i] % S > 0);
		if (i > 0) {
			p[i] += p[i-1];
		}
	}

	int t = 2000000000;
	for (int i = 0, k = K; i < p.size(); i++) {
		k = K;
		for (int j = 0, mod = 0; j < p.size(); j++) {
			if (k < 0) {
				break;
			}
			if (p[j] - mod >= p[i]) {
				k--;
				mod = p[j];
			}
		}
		if (k >= 0) {
			t = min(t, p[i]);
		}
	}

	printf("%d", t);
}