Submission #31021283

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using pii = pair<int, int>;
using ll = long long;

const int inf = 1e9;

int main() {
	int n;
	cin >> n;
	vector<int> a(n);
	rep(i, n) cin >> a[i];

	vector<vector<int>> id(n);
	rep(i, n) {
		id[a[i] - 1].push_back(i);
	}
	rep(i, n) id[i].push_back(inf);

	int q;
	cin >> q;
	rep(i, q) {
		int l, r, x;
		cin >> l >> r >> x;
		l--, r--, x--;
		auto itr1 = lower_bound(id[x].begin(), id[x].end(), l);
		auto itr2 = upper_bound(id[x].begin(), id[x].end(), r);
		int ans = itr2 - itr1;
		cout << ans << endl;
	}
	return 0;
}

Submission Info

Judge Result