using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Text; class Program { static void Main() { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; var sc = new Scan(); var se = new Search(); int n = sc.Int; var a = sc.IntArr; var b = new int[n]; var ar = a.ToList().Distinct().ToArray(); Array.Sort(ar); int lim = ar.Length; var zip = new SortedDictionary(); for (int i = 0; i < lim; i++) zip.Add(ar[i], i); var sgbef = new Segtree(lim, (i, j) => i + j, 0); var sgaft = new Segtree(lim, (i, j) => i + j, 0); var sgmul = new Segtree(lim, (i, j) => i + j, 0); for (int i = 0; i < n; i++) { b[i] = zip[a[i]]; sgaft.update(b[i], sgaft.look(b[i]) + 1); } var anss = new long[lim]; for (int i = 0; i < n; i++) { sgaft.update(b[i], sgaft.look(b[i]) - 1); sgmul.update(b[i], sgbef.look(b[i]) * sgaft.look(b[i])); anss[b[i]] += sgbef.run(0, b[i]) * sgaft.run(0, b[i]) - sgmul.run(0, b[i]) + sgbef.run(b[i] + 1, lim) * sgaft.run(b[i] + 1, lim) - sgmul.run(b[i] + 1, lim); sgbef.update(b[i], sgbef.look(b[i]) + 1); sgmul.update(b[i], sgbef.look(b[i]) * sgaft.look(b[i])); } var imos = new long[lim + 1]; for (int i = 0; i < lim; i++) { imos[i + 1] = imos[i] + anss[i]; } int q = sc.Int; for (int i = 0; i < q; i++) { var c = sc.IntArr; sw.WriteLine(imos[se.UpperBound(ar, c[1])] - imos[se.LowerBound(ar, c[0])]); } sw.Flush(); } } class Scan { public int Int { get { return int.Parse(Str); } } public long Long { get { return long.Parse(Str); } } public string Str { get { return Console.ReadLine().Trim(); } } public int[] IntArr { get { return Str.Split().Select(int.Parse).ToArray(); } } } class Segtree { int n; T[] tree; Func f; T exnum; public Segtree(int m, Func f, T ex) { this.f = f; this.exnum = ex; n = 1; while (n < m) n <<= 1; tree = new T[(n << 1) - 1]; for (int i = 0; i < tree.Length; i++) tree[i] = ex; } public Segtree(int m, T ini, Func f, T ex) { this.f = f; this.exnum = ex; n = 1; while (n < m) n <<= 1; tree = new T[(n << 1) - 1]; for (int i = 0; i < tree.Length; i++) tree[i] = ini; for (int i = 0; i < m; ++i) update(i, ini); } public void update(int j, T x) { int i = j + n - 1; tree[i] = x; while (i > 0) { i = (i - 1) >> 1; tree[i] = f(tree[(i << 1) + 1], tree[(i << 1) + 2]); } } public T look(int i) { return tree[i + n - 1]; } // [s, t) public T run(int s, int t) { return query(s, t, 0, 0, n); } T query(int s, int t, int k, int l, int r) { if (r <= s || t <= l) return exnum; if (s <= l && r <= t) return tree[k]; return f(query(s, t, (k << 1) + 1, l, (l + r) >> 1), query(s, t, (k + 1) << 1, (l + r) >> 1, r)); } } class Search { // nより大きいの項のindexのうち最小のものを返す // n以下の項のindexのうち最大のもの+1を返す // そこに挿入 public int UpperBound(IList a, T n) where T : IComparable { if (a.Count == 0) return 0; int l = 0, r = a.Count - 1; while (l < r) { int m = (l + r) / 2; if (a[m].CompareTo(n) <= 0) { if (a[m + 1].CompareTo(n) > 0) return m + 1; l = m + 1; } else r = m - 1; } if (a[l].CompareTo(n) <= 0) return l + 1; return l; } // n未満の項のindexのうち最大のもの+1を返す // n以上の項のindexのうち最小のものを返す // そこに挿入 public int LowerBound(IList a, T n) where T : IComparable { if (a.Count == 0) return 0; int l = 0, r = a.Count - 1; while (l < r) { int m = (l + r) / 2; if (a[m].CompareTo(n) < 0) { if (a[m + 1].CompareTo(n) >= 0) return m + 1; l = m + 1; } else r = m - 1; } if (a[l].CompareTo(n) < 0) return l + 1; return l; } }