#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
using namespace std;
int n,q,a,k,l;
vector<int>v,poz,pom;//duze jedno do usuniecia
int pod[10007];
int licz[107][10007];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>l;
for(int i=0;i<n;i++){
cin>>a;
v.push_back(a);
}
cin>>q;
for(int i=0;i<q;i++){
cin>>k;
k=l-k;
pom.push_back(k);
}
for(int i=0;i<l-1;i++){
for(int j=i+1;j<n;j++){
if(v[i]==v[j])pod[j-i]++;
}
}
for(int i=l-1;i<n;i++){
if(i!=l-1){
i=i-l;
for(int j=i+1;j<n;j++){
if(v[i]==v[j])pod[j-i]--;
}
i=i+l;}
for(int j=i+1;j<n;j++){
if(v[i]==v[j])pod[j-i]++;
}
for(int j=i+1;j<n;j++){
for(int s=0;s<q;s++){
k=pom[s];
if(pod[-i+j]>=k){
licz[s][i-l+1]++;
licz[s][j-l+1]++;
}
}
}
}
for(int i=0;i<q;i++){
for(int j=0;j<n-l+1;j++){
cout<<licz[i][j]<<" ";
}
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... |