0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-13 04:06:26 +00:00
OI-codes/Luogu/P1190/P1190.cpp

28 lines
469 B
C++

#include <bits/stdc++.h>
using namespace std;
int n, m, w[10005], p, t, s;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
p = m;
while (p <= n) {
for (int i = 0; i < m; i++) {
w[i]--;
if (!w[i]) {
w[i] = w[p++];
}
}
t++;
}
for (int i = 0; i < m; i++) {
s = max(s, w[i]);
}
cout << t + s << endl;
return 0;
}