题目链接:https://codeforces.com/group/NVaJtLaLjS/contest/236425/problem/H
题目大意:
GukiZ教授正想着怎么去学校,因为有太多箱子挡道。还好有m个好学生愿意帮助他。不妨将道路看作一条直线,直线上有n堆箱子,可以为空,开始学生们站在箱子的左边,每个学生在一秒钟必须做出两个选择中的一个:1。如果他的当前位置有箱子,可以去掉一个;2.向右走一步。由于学生们都不甚聪明,他们请你指挥他们,令花费时间最少。
解题思路:
首先要看清楚题目:Students are working simultaneously.学生同时工作!假设答案为x秒,每个学生就有x秒钟时间去掉箱子!那么直接二分枚举答案暴力模拟就好了…注意用long long
代码如下:
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll maxn = 1e5 + 5;
const ll inf = 1e18 + 10;
ll n, m;
ll a[maxn];
bool Check(ll time){
ll num = m;
ll left = 0;
ll pile[maxn];
ll last = 0;
for(int i = 0; i < n; ++i){
pile[i] = a[i];
if(a[i]) last = i;
}
//cout << endl << endl;
//cout << time << endl;
while(left != last || num > 0){
if(num == 0) break;
num--;
ll t = time - left;
for(int i = left; i < n; ++i){
//cout << pile[i] << endl;
if(pile[i] < t-1){
//cout << t << endl;
t -= (pile[i] + 1);
pile[i] = 0;
left = i;
if(pile[last] == 0 && i == last) break;
//cout << pile[i] << ' ' << pile[i+1] << ' ' << t << endl;
}
else{
left = i;
pile[i] -= t-1;
//cout << pile[i] << endl;
break;
}
}
}
if(!pile[last] && left == last) return true;
return false;
}
int main(){
std::ios::sync_with_stdio(false);
while(cin >> n >> m){
for(int i = 0; i < n; ++i)
cin >> a[i];
ll l = 1, r = inf;
//cout << r << endl;
while(l < r){
//cout << 2 << endl;
ll mid = (l+r) / 2;
if(Check(mid)) r = mid;
else l = mid+1;
}
cout << l << endl;
}
return 0;
}