题目链接:https://ac.nowcoder.com/acm/contest/917/H
思路:询问区间内 出现的次数,注意 的情况即可。
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll ;
const int maxn = 2e5+7;
const int mod = 20180623;
int n, m, cnt, root[maxn], a[maxn], vis[maxn], l, r, k;
vector<int> v;
struct node{int l, r; ll sum;} T[maxn*25];
int getid(int x){return lower_bound(v.begin(),v.end(),x)-v.begin()+1;}
void update(int l,int r,int &now, int pre, int pos)
{
T[++cnt] = T[pre], T[cnt].sum++, now = cnt;
if(l == r) return;
int mid = (l + r) / 2;
if(mid>=pos) update(l, mid, T[now].l, T[pre].l, pos);
else update(mid+1, r, T[now].r, T[pre].r, pos);
}
ll query(int l, int r, int L, int R, int k)
{
if(l == r) return T[R].sum - T[L].sum;
int mid = (l + r) / 2;
if(mid >= k) return query(l, mid, T[L].l, T[R].l, k);
else return query(mid+1, r, T[L].r, T[R].r, k);
}
int main()
{
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++) scanf("%d",&a[i]),v.push_back(a[i]), vis[a[i]] = 1;
sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end());
for(int i = 1; i <= n; i++) update(1,n,root[i],root[i-1],getid(a[i]));
for(int i = 1; i <= m; i++)
{
int l2, r2;
scanf("%d%d%d%d%d", &l, &r, &l2, &r2, &k);
if(l > r) swap(l ,r);if(l2 > r2) swap(l2, r2);
if(!vis[k]) {printf("0\n0\n0\n"); continue;}
int pos = getid(k);
ll ans1 = query(1,n,root[l-1],root[r], pos) % mod;
ll ans2 = query(1,n,root[l2-1],root[r2], pos) % mod;
ll ans = (ans1 % mod * ans2 % mod) % mod;
printf("%lld\n%lld\n%lld\n",ans1, ans2, ans);
}
return 0;
}