秘技：召唤大佬！
@[蒟蒻_233](/space/show?uid=128141)
by A_Đark_Horcrux @ 2018-11-03 10:43:39
2333
by Kio_ @ 2018-11-03 10:44:14
同机房滋磁
by Kio_ @ 2018-11-03 10:44:38
同机房资瓷
by nofall @ 2018-11-03 10:46:09
@[Lonely_people](/space/show?uid=118317) 。。。您哪位
还有，说重点啊啊啊啊啊啊
by A_Đark_Horcrux @ 2018-11-03 10:49:41
。。。。
by nofall @ 2018-11-03 10:50:30
给你看代码吧
by nofall @ 2018-11-03 10:50:47
@[Lonely_people](/space/show?uid=118317) 发上来
by A_Đark_Horcrux @ 2018-11-03 10:52:17
我不是大佬
by Aestas16 @ 2018-11-03 11:01:39
```cpp
#include <cstring>
#include <cstdio>
using namespace std;
int main()
{
int i,m,n,w[10005]={},t[105]={},mm[105]={};
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&w[i]);
int q=1;
while(q<=n) {
for(i=1;i<=m;i++){
if(mm[i]==0) {
t[i]+=w[q];
q++;
mm[i]=w[q-1];
}
mm[i]--;
}
}
int maxx=0;
for(i=1;i<=m;i++)
if(maxx<t[i])
maxx=t[i];
printf("%d",maxx);
return 0;
}
```
by resftlmuttmotw @ 2018-11-03 11:04:30