by CraZYali @ 2016-08-04 12:55:01
[PIC=2377]
by CraZYali @ 2016-08-04 13:00:13
by CraZYali @ 2016-08-04 13:13:39
```cpp
var a:array[0..3001] of longint;
n,m,i,s,min:longint;
begin
readln(n,m);
for i:=1 to n do
readln(a[i]);
for i:=1 to m do
s:=s+a[i];
min:=s;
for i:=2 to n-m+1 do
begin
s:=s-a[i-1]+a[i+m-1];
if s<min then
min:=s;
end;
writeln(min);
end.
```
by Ape_epA @ 2016-08-24 09:12:38
紫阳大神啊，我也是80
by YaliKiWi @ 2017-02-18 13:43:46
wa了两个点
by YaliKiWi @ 2017-02-18 13:44:53
```cpp
#include<bits/stdc++.h>
using namespace std;
short a[3001];
int main()
{
int n,m,x=2147483647;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n-m-1;i++){
int s=0;
for(int j=i;j<=i+m-1;j++){
s+=a[j];
}
if(s<x)x=s;
}
cout<<x;
return 0;
}
```
by YaliKiWi @ 2017-02-18 13:46:33
可怜的孩子们啊！你们注意循环里的细节了吗？我也是卡80WA了两个点。
```cpp
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
int a[3001],i,j,n,m,ans=0,min1=99999;
cin >> n >> m;
for (i=1;i<=n;i++) cin >> a[i];
for (i=1;i<=n-m+1;i++){
for (j=i;j<=i+m-1;j++){
ans+=a[j];
}
if (ans<min1) {
min1=ans;
ans=0;
}
else ans=0;
}
cout << min1;
return 0;
}
```
by ZYR_ @ 2017-04-16 20:14:22
hehe
by ztz_cpp @ 2017-04-22 13:58:58
```cpp
#include<bits/stdc++.h>
using namespace std;
int n,m,a[3005],ans=100000005,now;
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=1;i<=n-m+1;i++){
for(int j=i;j<=i+m-1;j++)
now+=a[j];
if(now<ans)
ans=now;
//ans=now<ans?now:ans;
now=0;
}
printf("%d\n",ans);
return 0;
}
```
by windows_11 @ 2017-10-07 10:04:54