This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
using ll = long long;
using vi = vector<ll>;
int n, l;
vi a;
int cmp(int x, int y) {
int t = 0;
for (int i = 0; i < l; i++)
t += a[x + i] != a[y + i];
return t;
}
vi t[10100];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> l;
a.resize(n);
for (auto &i : a)
cin >> i;
for (int i = 0; i + l - 1 < n; i++) {
for (int j = i+1; j + l - 1 < n; j++) {
t[i].pb(cmp(i, j));
t[j].pb(t[i].back());
}
}
for(int i = 0; i < n; i++)
sort(all(t[i]));
int q, z;
cin >> q;
while(q--) {
cin >> z;
for(int i = 0; i + l - 1 < n; i++) {
auto it = upper_bound(all(t[i]), z);
cout << (it-t[i].begin()) << ' ';
}
cout << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |