标签：1623 stones heaps give int 题解 h1 heap Problem

Solution

　　Another binary search! 

　　The only thing you need to take notice of is that you have to do the thing in the follewing order:3->n.But there's a paradox.If you want to know how many stones you want to give to the two heaps before the current heap,you have to know how many stones the two heaps after the current heap will give to the cuurrent heap.

　　So change your mind.Start with the last heap.The stones one heap can give away is min(h[i],h1[i]-s),(h[i] means the stones one heap originally has,while h1[i] means the stones one heap has after the two heaps has done their operations.)(s means the required number of each heap).

　　The AC code is as follow:

#include<bits/stdc++.h>
using namespace std;
#define N 200005
#define mp make_pair
#define ll long long
int n;
int t;
int h[N];
int h1[N];
bool tell1(int s){
//    cout<<s<<endl;
    int now = n;
    for(int i=1;i<=n;i++) h1[i] = h[i];
    while(now>=3){
        if(h1[now]<s) return false;
        int operation = min(h[now],h1[now]-s)/3;
        h1[now-1]+=operation;
        h1[now-2]+=operation*2;
        now--;
    }
    if(h1[1]<s||h1[2]<s) return false;
    return true;
}
int main(){
    cin>>t;
    while(t--){
        cin>>n;
        int r = 0;
        for(int i=1;i<=n;i++){
            cin>>h[i];
            r = max(r,h[i]);    
        }
        int l = 0;
        while(l<r){
            int mid = (l+r+1)/2;
            if(tell1(mid)){
                l = mid;
            }else{
                r = mid-1;
            }
        }
        cout<<l<<endl;
    }
    return 0;
}

标签：1623,stones,heaps,give,int,题解,h1,heap,Problem
来源： https://www.cnblogs.com/OceanCT/p/15766872.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。