0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 17:51:58 +00:00

P7273 ix35 的等差数列

R56616911
This commit is contained in:
Baoshuo Ren 2021-08-21 20:49:32 +08:00 committed by Baoshuo Ren
parent bbaeaa0472
commit aa200e97ca
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

View File

@ -0,0 +1,31 @@
#include <bits/stdc++.h>
using namespace std;
int n, w, a[300005], t[300005], ans;
int main() {
cin >> n >> w;
if (n == 1) {
cout << 0 << endl;
exit(0);
}
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ans = n;
for (int d = 0; (n - 1) * d + 1 <= w; d++) {
for (int i = 0; i < n; i++) {
if (a[i] > d * i && a[i] - (i - n + 1) * d <= w) {
ans = min(ans, n - ++t[a[i] - d * i]);
}
}
for (int i = 0; i < n; i++) {
if (a[i] > d * i) {
t[a[i] - d * i] = 0;
}
}
}
cout << ans << endl;
return 0;
}