Raslboyy

752

Dec 21st, 2019
113
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.00 KB | None | 0 0
  1. #include <iostream>
  2. #include <vector>
  3. #include <algorithm>
  4. #include <string>
  5. #include <math.h>
  6. #include <climits>
  7.  
  8. //#pragma GCC optimize("O3, unroll-loops");
  9.  
  10. #include <list>
  11. #include <map>
  12. #include <set>
  13. #include <queue>
  14. #include <unordered_map>
  15. #include <unordered_set>
  16.  
  17. //#include <chrono>
  18. //#include <fstream>
  19. //#include <bits/stdc++.h>
  20.  
  21. #define mp make_pair
  22. #define pb push_back
  23. #define eb emplace_back
  24. #define x first
  25. #define y second
  26. #define sz(x) (int)x.size()
  27. #define all(x) begin(x), end(x)
  28. #define rall(x) rbegin(x), rend(x)
  29. #define FOR(i,a,b) for (int i = (a); i < (b); i++)
  30. #define RFOR(i,b,a) for (int i = (b) - 1; i >= (a); i--)
  31.  
  32. using namespace std;
  33.  
  34. typedef unsigned long long ull;
  35. typedef long long ll;
  36. typedef long double ld;
  37. typedef pair<int, int> pi;
  38. typedef pair<ll, ll> pl;
  39. typedef vector<int> veci;
  40. typedef vector<bool> vecb;
  41. typedef vector<vector<int>> vvi;
  42. typedef vector<vector<bool>> vvb;
  43.  
  44. const int INF_I = 1e9;
  45. const ll INF_LL = 1e18;
  46.  
  47. int main() {
  48.     /*ifstream cin("in.txt");
  49.     ofstream cout("out.txt");
  50.     auto start_time = chrono::high_resolution_clock::now();*/
  51.  
  52.     ios::sync_with_stdio(false);
  53.     cin.tie(0);
  54.     cout.tie(0);
  55.  
  56.    
  57.     int n;
  58.     cin >> n;
  59.     veci a(n);
  60.     FOR(i, 0, n)
  61.         cin >> a[i];
  62.     veci lg(n+1);
  63.     FOR(i, 1, n + 1)
  64.         lg[i] = log(i)/log(2);
  65.  
  66.     vector<vector<pi>> st(lg[n] + 1, vector<pi>(n));
  67.     FOR(i, 0, n) {
  68.         st[0][i].x = a[i];
  69.         st[0][i].y = i;
  70.     }
  71.  
  72.     for (int i = 1; i < lg[n] + 1; i++)
  73.         for (int j = 0; j < n && j + (1 << i - 1) < n; j++)
  74.             st[i][j] = max(st[i - 1][j], st[i - 1][j + (1 << i - 1)]);
  75.  
  76.    
  77.     int q;
  78.     cin >> q;
  79.     while (q--) {
  80.         int l, r;
  81.         cin >> l >> r;
  82.         l--, r--;
  83.         int k = lg[r - l + 1];
  84.         cout << max(st[k][l], st[k][r - (1<<k) + 1]).x << " " << max(st[k][l], st[k][r - (1 << k) + 1]).y + 1 << "\n";
  85.     }
  86.    
  87.     /*auto end_time = chrono::high_resolution_clock::now();
  88.     chrono::duration<double> duration = end_time - start_time;
  89.     cout << duration.count() << "\n";
  90.     cin.close();
  91.     cout.close();*/
  92.     return 0;
  93. }
Add Comment
Please, Sign In to add comment