悬赏关注
by Hua345 @ 2023-11-11 10:53:16
```cpp
#include<bits/stdc++.h>
using namespace std;
long long a[1000005],s[1000005],maxx,n,k;
int main()
{
cin>>n>>k;
for(int i = 1;i <= n - 1;i++)
{
cin>>a[i];
s[i] = s[i - 1] + a[i];
}
for(int i = 1;i <= n - 1;i++)
{
if(i + k - 1 > n - 1)
{
maxx = max(s[n - 1] - s[i - 1],maxx);
}
else
{
maxx = max(s[i + k - 1] - s[i - 1],maxx);
}
}
cout<<s[n - 1] - maxx;
return 0;
}
```
**AC了你自己看看（记得关注）**
by WRQwangziang @ 2024-04-20 16:53:00