题解 | 降温（easy）

#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using PII=pair<ll,ll>;
using PIII=pair<int,pair<int,int>>;
const ld ESP = 1e-10;
const ld PI = acosl(-1);
const int N=1e5+10;
const int M=2e5+10;
// const int mod = 1000000007;
const int mod = 998244353;
//随机化
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<> dis(1, 1000000000);
// cout<<fixed<<setprecision(10);

void solve(){
    int n,x;
    cin>>n>>x;
    int a[n+1],b[n+1];
    for(int i=1;i<=n;i++){
        cin>>a[i];
        b[i]=a[i];
    }
    int mx=0;
    for(int i=2;i<=n;i++){
        if(a[i]==-999){
            if(a[i-1]==-999)a[i-1]=50;
            if(a[i-1]-x>=-50){
                a[i]=a[i-1]-x;
            }else{
                a[i]=50;
            }
            mx+=(a[i-1]-a[i])>=x;
        }else{
            if(a[i-1]==-999) a[i-1]=50;
            mx+=(a[i-1]-a[i])>=x;
        }
    }
    int mi=0;
    for(int i=n-1;i>=1;i--){
        if(b[i]==-999){
            if(b[i+1]==-999)b[i+1]=50;
            if(b[i+1]+x-1<=50){
                b[i]=b[i+1]+x-1;
            }else{
                b[i]=50;
            }
        }else{
            if(b[i+1]==-999){
                b[i+1]=50;
            }
        }
        mi+=(b[i]-b[i+1])>=x;
    }
    cout<<mx<<" "<<mi<<'\n';
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _=1;
    // cin>>_;
    while(_--){
        solve();
    }
    return 0;
}

// 3
// 4
// 3
// 100
// 5
// 3