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>
using namespace std;
long long n,l,k,a[300005],cnt[300005],pr[300005],ans[300005],q;
int main()
{
cin>>n>>l;
for (int i=1; i<=n; i++)
{
cin>>a[i];
}
cin>>q;
cin>>k;
k=(l-k);
for (int d=1; d<=n-1; d++)
{
for (int j=1; j<=n-d; j++)
{
if(a[j]==a[j+d]) cnt[j]++;
}
for (int j=1; j<=n-d; j++)
{
pr[j]=pr[j-1]+cnt[j];
cnt[j]=0;
}
for (int j=l; j<=n-d; j++)
{
if (pr[j]-pr[j-l]>=k) ans[j-l+1]++, ans[j-l+1+d]++;
}
}
for (int i=1; i<=n-l+1; i++)
{
cout<<ans[i]<<" ";
}
cout<<endl;
}
# | 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... |