序列A,选择一些a[i] , 任意一个长度为m的区间内至少有一个所选的
问 sum{ a[i] } 的最小值
#include <iostream> #include <cstring> using namespace std; const int N=2e5+5; int a[N],n,m,f[N]; int hh,tt,q[N]; void solve(){ int i,j; for(i=0;i<=n;i++) f[i]=1e9; f[0]=0; hh=tt=1; for(i=1;i<=n;i++){ while(hh<=tt&&q[hh]<i-m) hh++; f[i]=f[q[hh]]+a[i]; while(hh<=tt&&f[i]<f[q[tt]]) tt--; q[++tt]=i; } int ans=1e9; for(i=n-m+1;i<=n;i++) ans=min(ans,f[i]); cout<<ans; } int main(){ cin>>n>>m; for(int i=1;i<=n;i++) cin>>a[i]; solve(); }
标签:int,1602,传递,solve,include,烽火 From: https://www.cnblogs.com/towboa/p/16849836.html