This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define db long double
#define vll vector<pll>
#define endl '\n'
#define all(x) x.begin(), x.end()
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
const int sz = 3e5 + 5;
int n, k, a[sz];
pii dp[sz][2];
void calc(int mid){
dp[1][0] = {0, 0}, dp[1][1] = {a[1] - mid, 1};
for(int i = 2; i <= n; i++){
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
dp[i][1] = max(make_pair(dp[i - 1][0].first + a[i] - mid, dp[i - 1][0].second + 1), make_pair(dp[i - 1][1].first + a[i], dp[i - 1][1].second));
}
}
void fmain(){
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
int l = 0, r = 1e15, res = 0;
while(l <= r){
int mid = (l + r) / 2;
calc(mid);
if(max(dp[n][0], dp[n][1]).second >= k){
l = mid + 1;
if(dp[n][0].second == k) res = max(res, dp[n][0].first + k * mid);
if(dp[n][1].second == k) res = max(res, dp[n][1].first + k * mid);
}
else{
r = mid - 1;
}
}
cout << res;
}
signed main(){
int tmr = 1;
//cin >> tmr;
while(tmr--){
fmain();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |