-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcopyingBooks_UVA714.cpp
90 lines (79 loc) · 2.05 KB
/
copyingBooks_UVA714.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
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <bits/stdc++.h>
using namespace std;
ifstream fin("copyingBooks_UVA714.in");
ofstream fout("copyingBooks_UVA714.out");
int main()
{
long long testCase; fin >> testCase;
for (long long t = 1; t <= testCase; ++t)
{
long long m, k; fin >> m >> k;
long long l = 0, r = 0;
vector<long long> a(m);
for (long long i = 0; i <= m - 1; ++i)
{
fin >> a[i];
r += a[i];
}
set<long long> s;
while (l <= r)
{
long long mid = (l + r) / 2,
kc = k, i = m - 1,
now = 0;
s.clear();
while (kc >= 1)
{
if (kc == 1)
{
while (i >= 0)
{
now += a[i];
--i;
}
break;
}
else if (i < kc - 1)
{
now = 0;
s.insert(i + 1);
--kc;
}
else if (now + a[i] > mid)
{
now = 0;
s.insert(i + 1);
--kc;
}
else
{
now += a[i];
--i;
}
}
if (now <= mid)
{
if (r == mid) break;
r = mid;
}
else
{
l = mid + 1;
}
}
vector<long long> fence_bool(m, 0);
for (auto it = s.begin(); it != s.end(); ++it)
{
long long pos = *it;
fence_bool[pos] = 1;
}
for (long long i = 0; i <= m - 1; ++i)
{
if (fence_bool[i] == 1) fout << " /";
if (i > 0) fout << ' ';
fout << a[i];
}
fout << '\n';
}
return 0;
}