样例都没过，就交了？
by Myor @ 2019-05-03 20:39:17
sum=s[wei]-s[tou-1];
应该是sum=s[wei - 1]-s[tou-1];吧
否则就计算m + 1个了
by Myor @ 2019-05-03 20:42:16
```cpp
#include<bits/stdc++.h>
using namespace std;
int a[200002],n,i,tou,wei,sum=0,minn=999999,s[200002],m;
int main()
{
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
for(tou=1;tou<=n-m+1;tou++)
{wei=tou+m-1;
sum=s[wei]-s[tou-1];
if(sum<minn)minn=sum;
}
cout<<minn;
}
```
改了改，主要是求一段和的地方有错
by wjy2006 @ 2019-05-03 20:43:16
@[爸爸最帅了](/space/show?uid=173431)
```
#include<bits/stdc++.h>
using namespace std;
int a[200002],n,i,tou,wei,sum=0,minn=999999,s[200002],m;
int main()
{
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++)
s[i]=s[i-1]+a[i];
for(tou=1;tou<=n - m;tou++)
{wei=tou+m;
sum=s[wei]-s[tou-1];
if(sum<minn)minn=sum;
}
cout<<minn;
}
by aminoas @ 2019-05-03 20:43:37
等等
by wjy2006 @ 2019-05-03 20:44:07
啊，楼上正解
by wjy2006 @ 2019-05-03 20:44:34
~~顺便吐槽lz马蜂~~
by aminoas @ 2019-05-03 20:45:54
# 谢谢大家~
~下去跑步淋了一圈雨才看到~~
by 退役の鱼 @ 2019-05-03 20:53:26
@[wjy2006](/space/show?uid=140780)
~~能不能加个注解啊（小声）~~
by 退役の鱼 @ 2019-05-03 21:01:22
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
char a[300][300],c,last='0';
int t,n,tot;
int main()
{
cin>>a[0];
n=strlen(a[0]);
for(int i=1;i<n;i++) cin>>a[i];
printf("%d ",n);
for(int j=0;j<n;j++)
{
for(int i=0;i<n;i++)
{
if(a[j][i]==last) tot++;
else
{
printf("%d ",tot);
last=a[j][i],tot=1;
}
}
}
cout<<tot;
return 0;
}
by 再见再见111 @ 2019-05-06 19:02:20