蓝桥杯2022年第十三届省赛A组真题-青蛙过河

 

#include <iostream>
#include <cstring>
#include <algorithm>
#include <stack>
using namespace std;
typedef long long LL;
typedef pair<int,int>pii;
const int mod = 1e9 + 7 , INF = 0x3f3f3f3f , N = 1e5 + 10;

int n,m;
int a[N];

bool check(int x)
{
    // 如果所有长度为x的区间都大于等于m ，则true
    int s = 0;
    
    for (int i = 1 ; i <= min(n - 1,x) ; i ++)
        s += a[i];
        
    if (s < m)
        return false;
    for (int i = x + 1; i <= n - 1; i ++)
    {
        s -= a[i - x];
        s += a[i];
        if (s < m)
            return false;
    }
    
    return s >= m;
}

int main()
{
    cin >> n >> m;
    m *= 2;
    for (int i = 1 ; i <= n - 1 ; i ++)
        cin >> a[i];    

    int l = 0,r = n;
    
    while (l < r)
    {
        int mid = l + r >> 1;
        if (check(mid))
            r = mid;
        else
            l = mid + 1;
    }
    
    cout << r << endl;
    
}