小米9月20日笔试题第二题,只过了91%

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
#include <iostream>
#include <vector>
#include <numeric>
#include <limits>
#include <cstring>
using namespace std;
const int MAXN = 100005;
bool divide(int a[], int n, int m, int tag) {
	for (int i = 0; i < n; ++i) {
		if (a[i] > tag) {
			return false;
		}
	}
	int sum = a[0];
	int cnt = 1;
	for (int i = 1; i < n; ++i) {
		if (sum + a[i] > tag) {
			sum = a[i];
			++cnt;
			if (cnt > m) {
				return false;
			}
		}
		else {
			sum += a[i];
		}
	}
	return true;
}
int a[MAXN];
int main(int argc, char** argv) {
	int n, m;
	while (cin >> n >> m) {
		int sum = 0;
		for (int i = 0; i < n; ++i) {
			cin >> a[i];
			sum += a[i];
		}
		int num;
		if (sum % m == 0) {
			num = sum / m;
		}
		else {
			num = sum / m + 1;
		}
		int res = -1;
		for (int i = num; i <= sum; ++i) {
			if (divide(a, n, m, i)) {
				res = i;
				break;
			}
		}
		cout << res << endl;
	}
	return 0;
}