您这。。
```cpp
j<=j+m
```
太强了%%%
by olinr @ 2019-02-25 06:18:30
@[olinr](/space/show?uid=88460) >...<j和i长的太像了QwQ
by 王宏宇11 @ 2019-02-25 23:11:58
@[olinr](/space/show?uid=88460) 改过以后第八个点和第0个点还是RE了...
```
j<=j+m;
改成了j<i+m
为啥还有问题哩QwQ
by 王宏宇11 @ 2019-02-25 23:17:11
应该是边界的问题吧
```cpp
#define _ 0
int n, m;
int a[5050];
int min = 0x7fffffff;
int main() {
n = in(), m = in();
int s = 0;
for(int i = 1; i <= n; i++) a[i] = in();
for(int i = 1; i <= m; i++) s += a[i];
min = std::min(min, s);
for(int i = m + 1; i <= n; i++)
{
s -= a[i - m];
s += a[i];
min = std::min(min, s);
}
printf("%d", min);
return ~~(0^_^0);
}
```
我是这么写的qwq
by olinr @ 2019-02-26 06:28:47
@[王宏宇11](/space/show?uid=123168) 。。。。
by olinr @ 2019-02-26 06:29:16
@[olinr](/space/show?uid=88460) 大佬的代码看不懂QWQ，我还是用我萌新式解法看看吧~~嘤嘤嘤~~
by 王宏宇11 @ 2019-02-26 23:11:34
@[olinr](/space/show?uid=88460) 数据也不大啊，为啥会越界呢...数组也多开了很多...
by 王宏宇11 @ 2019-02-26 23:15:03
@[王宏宇11](/space/show?uid=123168)
额，是你sort的问题，我把你代码改了qwq
```cpp
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int a[30005];
int b[30005];
int main()
{int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n-m+1;i++)
for(int j=i;j<i+m;j++)
b[i]=b[i]+a[j];
sort(b+1,b+n-m+1);
cout<<b[1];
return 0;
}
```
这个本人实交能过qwq
by olinr @ 2019-02-27 06:18:32
@[王宏宇11](/space/show?uid=123168)
Hack数据
```cpp
5 5
1 2 3 4 5
```
你的RE
正解15
by olinr @ 2019-02-27 06:19:20
@[olinr](/space/show?uid=88460) 原来是这样啊，sort越界了，嘤嘤嘤，还真没注意到，谢谢大佬出手相助
by 王宏宇11 @ 2019-02-27 23:28:00