202210212034

Author: mkmark

independent/202210212034/0.in

@@ -0,0 +1 @@
+[3, 1, 9, 4, 5, 6, 7, 0, 2]

independent/202210212034/README.md

@@ -0,0 +1 @@
+给定一个整数数组a，元素各不相同，求max（j-i）且a[j]＞a[i]，要求复杂度最多O N

independent/202210212034/main.cpp

@@ -0,0 +1,39 @@
+/*
+author: [email protected]
+*/
+
+#include <bits/stdc++.h>
+#include "../../lib/LeetCodeInputTemplate.hpp"
+#include "solution.cpp"
+using namespace std;
+
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+int main()
+{
+    LeetCodeInput li("0.in");
+
+    auto l0 = li.get<vi>(0);
+
+    chrono::steady_clock::time_point begin = chrono::steady_clock::now();
+    Solution solution;
+    auto output = solution.solution(l0);
+    chrono::steady_clock::time_point end = chrono::steady_clock::now();
+    cout << "Time difference = " << chrono::duration_cast<chrono::microseconds> (end - begin).count() << "µs" << endl;
+
+    cout << output << endl;
+
+    // for (int i: output){
+    //     cout << i << ' ';
+    // }
+
+    // for (auto i: output){
+    //     for (int j: i){
+    //         cout << j << ' ';
+    //     }
+    //     cout << '\n';
+    // }
+
+    return 0;
+}

independent/202210212034/solution.cpp

@@ -0,0 +1,58 @@
+/*
+author: [email protected]
+time: O()
+space: O()
+
+Runtime: 
+Memory Usage: 
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define all(x) begin(x), end(x)
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+class Solution {
+public:
+    int solution(vi a) {
+        int n = size(a);
+        queue<pair<int,int>> x;
+        stack<pair<int,int>> y;
+        int min = a[0];
+        int max = a[n-1];
+        x.emplace(min, 0);
+        y.emplace(max, n-1);
+        for (int i=1; i<n; ++i){
+            if (a[i]<min){
+                min = a[i];
+                x.emplace(min, i);
+            }
+        }
+        for (int i=n-1; i>0; --i){
+            if (a[i]>max){
+                max = a[i];
+                x.emplace(max, i);
+            }
+        }
+        int ans = -2147483648;
+        while (!x.empty() && !y.empty()){
+            if (x.front().first > y.top().first){
+                x.pop();
+            } else {
+                ans = std::max(ans, y.top().second - x.front().second);
+                y.pop();
+            }
+        }
+        return ans;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();