P1190 [NOIP2010 普及组] 接水问题

P1190 [NOIP2010 普及组] 接水问题

解题思路：模拟即可。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lf;
typedef unsigned long long ull;
typedef pair<ll,int>P;
const int inf = 0x7f7f7f7f;
const ll INF = 1e16;
const int N = 1e6+10;
const ull base = 131;
const ll mod =  1e9+7;
const double PI = acos(-1.0);
const double eps = 1e-4;

inline int read(){
    
    int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){
    
    if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){
    
    x=x*10+ch-'0';ch=getchar();}return x*f;}
inline string readstring(){
    
    string str;char s=getchar();while(s==' '||s=='\n'||s=='\r'){
    
    s=getchar();}while(s!=' '&&s!='\n'&&s!='\r'){
    
    str+=s;s=getchar();}return str;}
int random(int n){
    
    return (int)(rand()*rand())%n;}
void writestring(string s){
    
    int n = s.size();for(int i = 0;i < n;i++){
    
    printf("%c",s[i]);}}
ll fast_power(ll a,ll p){
    
    
    ll ans = 1;
    while(p){
    
    
        if(p&1) ans = (ans*a)%mod;
        p >>= 1;
        a = (a*a)%mod;
    }
    return ans;
}



int a[N];
int num[N];



int main(){
    
    
    //srand((unsigned)time(NULL));
    //freopen(  "out.txt","w",stdout);
    priority_queue<int,vector<int>,greater<int> >que;
    int n = read(),m = read();
    int ma = 0;
    for(int i = 1;i <= n;i++){
    
    
        a[i] = read();
        ma = max(ma,a[i]);
    }
    if(n <= m){
    
    
        cout<<ma<<endl;
    }else {
    
    
        int ans = 0;
        for(int i = 1;i <= m;i++){
    
    
            num[i] = a[i];
        }
        int i = m+1;
        while(i <= n){
    
    
            for(int j = 1;j<=m&&i<=n;j++){
    
    
                if(num[j] == 0){
    
    
                    num[j] = a[i++];
                }
            }
            if(i <= n){
    
    
                ans += 1;
                for(int j = 1;j <= m;j++){
    
    
                    num[j]--;
                }
            }
        }
        ma = 0;
        for(int j = 1;j <= m;j++){
    
    
            ma = max(ma,num[j]);
        }
        cout<<ans+ma<<endl;
    }
    return 0;
}