好像是暴力解的,没想到还过了qwq
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
scanf("%d",&n);
int a[n+1];
for(int i = 1;i <= n;i ++) scanf("%d",&a[i]);
int q;
scanf("%d",&q);
for(int i = 1;i <= q;i ++){
int count = 0;
int l,r,k;
scanf("%d%d%d",&l,&r,&k);
for(int i = l;i <= r;i ++)
if(a[i] == k) count++;
printf("%d\n",count);
}
return 0;
}