绿色通道(单调队列dp)


崩溃了,debug半天发现是变量名重复了

#include<iostream>
#include<cstring>
#define int long long 
using namespace std;
const int N=1e5;
int q[N];
int f[N];
int w[N];
int sum=0;
signed main(){
    int n,ti;
    cin>>n>>ti;
    for(int i=1;i<=n;i++)cin>>w[i],sum+=w[i];
    int l=1,r=n;
    int mid;
    int s;
    while(l+1<r){
        memset(f,0,sizeof(f));
        memset(q,0,sizeof(q));
        mid=(l+r)>>1;
        int h=1,t=0;
        int ans=1e9;
        for(int i=1;i<=n;i++){
            while(h<=t&&q[h]<i-mid)h++;
            while(h<=t&&f[q[t]]>=f[i-1])t--;
            q[++t]=i-1;
            f[i]=f[q[h]]+w[i];
            if(i>n-mid)ans=min(ans,f[i]);
        }
        if(ans<=ti)r=mid,s=mid;
        else l=mid;
    }
    cout<<s-1;
    return 0;
}
posted @ 2025-02-15 18:12  郭轩均  阅读(9)  评论(0)    收藏  举报