Create DQUERY.cpp

Author: AymanSalah96

SPOJ/DQUERY.cpp

@@ -0,0 +1,130 @@
+#define _CRT_SECURE_NO_WARNINGS
+#include <cstring>
+#include <map>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <sstream>
+#include <numeric>
+#include <iostream>
+#include <iomanip>
+#include <cstdio>
+#include <cmath>
+#include <hash_map>
+#include <fstream>
+#include <string>
+#include <cstdlib>
+#include <ctime>
+#include <functional>
+#include <algorithm>
+#include <vector>
+#include <set>
+#include <complex>
+#include <list>
+#include <climits>
+#include <cctype>
+#include <bitset>
+using namespace std;
+
+#define PI 3.14159265359
+#define all(v) v.begin(),v.end()
+#define sortva(v) sort(all(v))
+#define sortvd(v) sort(v.rbegin(),v.rend())
+#define sortaa(a,n) sort(a,a+n)
+#define sortad(a,n) sort(a,a+n),reverse(a,a+n)
+#define sfi1(v) scanf("%d",&v)
+#define sfi2(v1,v2) scanf("%d %d",&v1,&v2)
+#define sfi3(v1,v2,v3) scanf("%d %d %d",&v1,&v2,&v3)
+#define sfll1(v) scanf("%I64d",&v);
+#define sfll2(v1,v2) scanf("%I64d %I64d",&v1,&v2)
+#define sfll3(v1,v2,v3) scanf("%I64d %I64d %I64d",&v1,&v2,&v3)
+#define sfstr(v) scanf("%s", v);
+#define sz(v) v.size()
+#define ndl puts("")
+#define SS stringstream
+typedef long long ll;
+typedef unsigned long long ull;
+int dx[] = { 0, 0, 1, -1, 1, -1, 1, -1 };
+int dy[] = { 1, -1, 0, 0, -1, 1, 1, -1 };
+
+ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
+ll lcm(ll a, ll b) { return (a / gcd(a, b)) * b; }
+
+void PLAY() {
+#ifndef ONLINE_JUDGE
+freopen("input.txt", "r", stdin);
+freopen("output.txt", "w", stdout);
+#endif
+cout << fixed << setprecision(10);
+ios::sync_with_stdio(0);
+cin.tie(0);
+cout.tie(0);
+}
+
+const int MAX = (1 << 17);
+const int MAX2 = 2e5;
+
+int BIT[MAX];
+
+int get(int idx) {
+idx++;
+int ret = 0;
+while (idx) {
+ret += BIT[idx - 1];
+idx -= (idx & -idx);
+}
+return ret;
+}
+
+void add(int idx, int val) {
+idx++;
+while (idx <= MAX) {
+BIT[idx - 1] += val;
+idx += (idx & -idx);
+}
+}
+
+int nxt[MAX], res[MAX2 + 5];
+vector<pair<int, int>> query[MAX2 + 5];
+
+int main() {
+PLAY();
+
+int n;
+cin >> n;
+vector<int> v(n);
+map<int, int> mp;
+
+for (int i = 0; i < n; i++) {
+cin >> v[i];
+auto it = mp.insert({ v[i], i }).first;
+if (it->second != i)
+nxt[it->second] = i;
+else
+add(i, 1);
+it->second = i;
+nxt[i] = -1;
+}
+
+int q;
+cin >> q;
+
+
+for (int i = 0; i < q; i++) {
+int l, r;
+cin >> l >> r;
+query[--l].push_back({ --r, i });
+}
+
+for (int i = 0; i < n; i++) {
+for (auto &p : query[i])
+res[p.second] = get(p.first);
+add(i, -1);
+if (nxt[i] != -1)
+add(nxt[i], 1);
+}
+for (int i = 0; i < q; i++)
+cout << res[i] << "\n";
+
+return 0;
+}