tien_noob

maxpair

Aug 3rd, 2021 (edited)
115
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.80 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. #define TASK "TESTCODE"
  3. using namespace std;
  4. const int N = 1e5;
  5. int index[N + 1], n, a[N + 1], res = 0;
  6. void read()
  7. {
  8.     cin >> n;
  9.     for (int i = 1; i <= n; ++ i)
  10.     {
  11.         cin >> a[i];
  12.         index[a[i]] = i;
  13.     }
  14. }
  15. void solve()
  16. {
  17.     index[0] = 1e9;
  18.     for (int i = 1; i <= n; ++ i)
  19.     {
  20.         res = max(res, index[i] - index[i - 1]);
  21.         index[i] = min(index[i], index[i - 1]);
  22.     }
  23.     cout << res;
  24. }
  25. int main()
  26. {
  27.     ios_base::sync_with_stdio(false);
  28.     cin.tie(nullptr);
  29.     //freopen(TASK".INP", "r", stdin);
  30.     //freopen(TASK".OUT", "w", stdout);
  31.     int t = 1;
  32.     bool typetest = false;
  33.     if (typetest)
  34.     {
  35.         cin >> t;
  36.     }
  37.     for (int __ = 1; __ <= t; ++ __)
  38.     {
  39.         read();
  40.         solve();
  41.     }
  42. }
  43.  
Add Comment
Please, Sign In to add comment