26 lines
443 B
C++
26 lines
443 B
C++
|
#include<bits/stdc++.h>
|
|||
|
|
using namespace std;
|
|||
|
|
const int N=3e3+5, INF=0x3f3f3f3f;
|
|||
|
|
int a[N],s[N];
|
|||
|
|
int main(){
|
|||
|
|
int n,m;
|
|||
|
|
cin>>n>>m;
|
|||
|
|
for(int i=1;i<=n;i++){
|
|||
|
|
cin>>a[i];
|
|||
|
|
s[i]=s[i-1]+a[i];
|
|||
|
|
}
|
|||
|
|
int ans=INF;
|
|||
|
|
|
|||
|
|
//ö<>ٵ<EFBFBD><D9B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>յ<EFBFBD>
|
|||
|
|
//for(int i=m;i<=n;i++) ans=min(ans,s[i]-s[i-m]);
|
|||
|
|
|
|||
|
|
//ö<>ٵ<EFBFBD><D9B5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
for(int i=1;i+m-1<=n;i++){
|
|||
|
|
int L=i,R=i+m-1;
|
|||
|
|
ans=min(ans,s[R]-s[L-1]);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
cout<<ans<<endl;
|
|||
|
|
return 0;
|
|||
|
|
}
|