-
Bio
#include<iostream> #include<string> #include<stack> #include<unordered_map> #include<cmath> using namespace std; long long m,n,b,x,y,cnt=0,cnt1=0; long long a[1000005]; int main(){ cin>>n>>m; for(int i=1;i<=n-1;i++){ cin>>b; cnt1+=b; a[i]=cnt1; } for(int i=m;i<=n-1;i++){ if(a[i]-a[i-m]>=cnt){ cnt=a[i]-a[i-m]; } } cout<<a[n-1]-cnt; return 0; }
-
Accepted Problems
-
Recent Activities
This person is lazy and didn't join any contests or homework.
Problem Tags
- 基础算法
- 4
- 前缀和与差分
- 2
- 模拟算法
- 2
- 蓝桥杯
- 2
- 递归
- 1
- 栈
- 1
- C++语法
- 1
- 入门
- 1
- 一本通
- 1