fork download
  1. #include <bits/stdc++.h>
  2. #include<stdio.h>
  3. #include<stdlib.h>
  4. #include<math.h>
  5. #include<cstring>
  6. #include<algorithm>
  7. #include<vector>
  8. #include<stack>
  9. #include<queue>
  10. #include<map>
  11. #include<set>
  12. using namespace std;
  13. #define int long long int
  14. #define endl '\n'
  15. #define vi vector<int>
  16. #define vb vector<bool>
  17. #define pii pair<int,int>
  18. #define ss second
  19. #define ff first
  20. #define vpii vector<pii>
  21. #define vvpii vector<vpii>
  22. #define vvi vector<vi>
  23. #define pb push_back
  24. #define vs vector<string>
  25. #define all(x) x.begin(),x.end()
  26. #define mii map<int,int>
  27. #define vd vector<double>
  28. #define deb(x) cout<<#x<<" -> "<<x<<endl
  29. #define rep(i,a,b) for(int i=a;i<b;i++)
  30.  
  31. void solve()
  32. {
  33. int n;
  34. cin>>n;
  35. vi v(n,0);
  36. set<int> s;
  37. rep(i,0,n) cin>>v[i];
  38. rep(i,0,n) s.insert(v[i]);
  39. sort(all(v));
  40. int diff=v[n-1]-v[0];
  41. int q;
  42. cin>>q;
  43. rep(i,0,q){
  44. int a,b;
  45. cin>>a>>b;
  46. if((b-a+1)>=diff) cout<<(v[n-1]+b-(v[0]+a)+1)<<endl;
  47. else cout<<s.size()*(b-a+1)<<endl;
  48. }
  49. }
  50.  
  51. int32_t main()
  52. {
  53. int t=1;
  54. ios_base::sync_with_stdio(0);
  55. cin.tie(0);
  56. // cin>>t;
  57. while(t--){
  58. solve();
  59. }
  60. }
Success #stdin #stdout 0.01s 5696KB
stdin
6
3 1 4 1 5 9
3
7 7
0 2
8 17
stdout
5
15
18