#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> a, b;
ll res;
ll solve(ll pun)
{
res = 0;
ll last = -pun;
ll seg_cnt = 0;
for (auto n : b)
{
if (n > 0)
{
last += n;
continue;
}
if (n < -pun)
{
if (last > 0)
{
res += last;
seg_cnt++;
}
last = -pun;
}
else
{
last += n;
}
if (last < -pun)
last = -pun;
}
if (last > 0)
{
res += last;
seg_cnt++;
}
return seg_cnt;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
ll N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
{
ll n; cin >> n;
if (n != 0)
a.push_back(n);
}
N = a.size();
{
int i = 0;
while (i < N && a[i] < 0)
i++;
ll sum = 0;
if (i < N) sum = a[i];
for (i++; i < N; i++)
{
if ((a[i-1] ^ a[i]) < 0)
{
b.push_back(sum);
sum = 0;
}
sum += a[i];
}
if (sum != 0)
b.push_back(sum);
if (b.size() && b.back() <= 0)
b.pop_back();
}
if (b.size() == 0)
{
cout << 0 << '\n';
return 0;
}
ll l = 0ll;
ll r = 1000000000000000000ll;
while (l < r)
{
ll c = (l + r) / 2ll;
if (solve(c) > K)
l = c + 1;
else
r = c;
}
solve(l);
cout << res + K * l << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
7112 KB |
Output is correct |
2 |
Correct |
23 ms |
7380 KB |
Output is correct |
3 |
Correct |
32 ms |
7380 KB |
Output is correct |
4 |
Correct |
25 ms |
7164 KB |
Output is correct |
5 |
Correct |
22 ms |
7376 KB |
Output is correct |
6 |
Correct |
22 ms |
7252 KB |
Output is correct |
7 |
Correct |
30 ms |
7112 KB |
Output is correct |
8 |
Correct |
25 ms |
7364 KB |
Output is correct |
9 |
Correct |
23 ms |
7108 KB |
Output is correct |
10 |
Correct |
22 ms |
7112 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
15 ms |
5588 KB |
Output is correct |
2 |
Correct |
14 ms |
5660 KB |
Output is correct |
3 |
Correct |
15 ms |
5588 KB |
Output is correct |
4 |
Correct |
15 ms |
5768 KB |
Output is correct |
5 |
Correct |
24 ms |
7376 KB |
Output is correct |
6 |
Correct |
14 ms |
5588 KB |
Output is correct |
7 |
Correct |
15 ms |
5588 KB |
Output is correct |
8 |
Correct |
23 ms |
7368 KB |
Output is correct |
9 |
Correct |
22 ms |
7380 KB |
Output is correct |
10 |
Correct |
15 ms |
5844 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
36 ms |
8904 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
7112 KB |
Output is correct |
2 |
Correct |
23 ms |
7380 KB |
Output is correct |
3 |
Correct |
32 ms |
7380 KB |
Output is correct |
4 |
Correct |
25 ms |
7164 KB |
Output is correct |
5 |
Correct |
22 ms |
7376 KB |
Output is correct |
6 |
Correct |
22 ms |
7252 KB |
Output is correct |
7 |
Correct |
30 ms |
7112 KB |
Output is correct |
8 |
Correct |
25 ms |
7364 KB |
Output is correct |
9 |
Correct |
23 ms |
7108 KB |
Output is correct |
10 |
Correct |
22 ms |
7112 KB |
Output is correct |
11 |
Correct |
15 ms |
5588 KB |
Output is correct |
12 |
Correct |
14 ms |
5660 KB |
Output is correct |
13 |
Correct |
15 ms |
5588 KB |
Output is correct |
14 |
Correct |
15 ms |
5768 KB |
Output is correct |
15 |
Correct |
24 ms |
7376 KB |
Output is correct |
16 |
Correct |
14 ms |
5588 KB |
Output is correct |
17 |
Correct |
15 ms |
5588 KB |
Output is correct |
18 |
Correct |
23 ms |
7368 KB |
Output is correct |
19 |
Correct |
22 ms |
7380 KB |
Output is correct |
20 |
Correct |
15 ms |
5844 KB |
Output is correct |
21 |
Incorrect |
36 ms |
8904 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |