ok
2025-03-12 16:17:50
发布于:浙江
1阅读
0回复
0点赞
#include <iostream>
using namespace std;
const int maxn = 1e4 + 9;
int w[maxn], a[109];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> w[i];
}
for (int i = 1; i <= m; i++) {
a[i] = w[i];
}
int now = m + 1, ans = 0;
while (now <= n) {
for (int i = 1; i <= m; i++) {
a[i]--;
if (a[i] == 0) {
if (now <= n) {
a[i] = w[now];
now++;
}
}
}
ans++;
}
int ma = 0;
for (int i = 1; i <= m; i++) {
ma = max(ma, a[i]);
}
cout << ans + ma;
return 0;
}
这里空空如也
有帮助,赞一个