LightOJ-Solutions/1076-Get-the-Container.cpp at master · hackerkid/LightOJ-Solutions · 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
65
66
67
#include <iostream>
#include <stdio.h>
#include <string.h>
#define N 10005
using namespace std;

int main()
{

	int t;
	int a[N];
	long long bb;
	long long sum[N];
	int m;
	long long maxi;
	int n;

	scanf("%d", &t);

	for (int cs = 1; cs <= t; cs++) {
		scanf("%d", &n);
		scanf("%d", &m);

		sum[n ] = 0;
		maxi = -1;
		bb = 0;
		int j;
		j = 0;

		for (int i = 0; i < n; i++) {
			scanf("%d", a + i);
		}

		for (int i = n - 1; i >= 0; i--) {
			sum[i] = sum[i + 1] + a[i ];
		}

		for (int i = 0; i < n; i++) {
		//	cout << sum[i] << " ";
		}

	//	cout << endl;

		for (int i = 0; i < n; ) {
			if(bb + a[i] <= maxi) {
				bb = bb + a[i];
				i++;
			}
			else {
				if((double)(bb + a[i]) <= (double) sum[i] / (m - (j + 1))) {
					bb = bb + a[i];
					maxi = max(maxi, bb);
					i++;
				}
				else {
					bb = 0;
				}

			}
		}

		printf("Case %d: %lld\n", cs, maxi);

	}


}