4 files changed, 184 insertions, 0 deletions
diff --git a/codeforces/SortTheSubarray/main b/codeforces/SortTheSubarray/main
new file mode 100755
index 0000000..ede436c
--- /dev/null
+++ b/codeforces/SortTheSubarray/main
diff --git a/codeforces/SortTheSubarray/main.cpp b/codeforces/SortTheSubarray/main.cpp
new file mode 100755
index 0000000..42d20bb
--- /dev/null
+++ b/codeforces/SortTheSubarray/main.cpp
@@ -0,0 +1,171 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpi = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b) - 1) / (b))
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const pair<K, V> &p);
+template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec);
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const map<K, V> &m);
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const unordered_map<K, V> &m);
+template <typename T> ostream &operator<<(ostream &os, const set<T> &s);
+template <typename T>
+ostream &operator<<(ostream &os, const unordered_set<T> &s);
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const pair<K, V> &p) {
+  os << "(" << p.first << ", " << p.second << ")";
+  return os;
+}
+
+template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
+  os << "{";
+  for (size_t i = 0; i < vec.size(); ++i) {
+    if (i > 0)
+      os << ", ";
+    os << vec[i];
+  }
+  os << "}";
+  return os;
+}
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const map<K, V> &m) {
+  os << "{";
+  for (const auto &p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const unordered_map<K, V> &m) {
+  os << "{";
+  for (const auto &p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
+  int i = 0;
+  os << "{";
+  for (const auto &e : s) {
+    if (i > 0)
+      os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+template <typename T>
+ostream &operator<<(ostream &os, const unordered_set<T> &s) {
+  int i = 0;
+  os << "{";
+  for (const auto &e : s) {
+    if (i > 0)
+      os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+void dbg() { cerr << "\n"; }
+
+template <typename T, typename... TS> void dbg(T val, TS... vals) {
+  cerr << val << " ";
+  dbg(vals...);
+}
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+std::pair<int, int> longest_sorted_subarray(std::vector<int> arr) {
+  int start = 0, end = 0, max_length = 0;
+  for (int i = 1; i < arr.size(); i++) {
+    if (arr[i] >= arr[i - 1]) {
+      end++;
+    } else {
+      int length = end - start + 1;
+      if (length > max_length) {
+        max_length = length;
+        start = i - length;
+        end = i - 1;
+      }
+      start = i;
+      end = i;
+    }
+  }
+  int length = end - start + 1;
+  if (length > max_length) {
+    max_length = length;
+    start = arr.size() - length;
+    end = arr.size() - 1;
+  }
+  if (max_length > 0) {
+    return {start, end};
+  } else {
+    return {-1, -1};
+  }
+}
+
+void solve() {
+  int n;
+  cin >> n;
+  vi a(n);
+  vi b(n);
+  for (auto &x : a) {
+    cin >> x;
+  }
+  for (auto &x : b) {
+    cin >> x;
+  }
+  pii ans = longest_sorted_subarray(b);
+  cout << ans.first + 1 << " " << ans.second + 1 << '\n';
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
diff --git a/codeforces/SortTheSubarray/main_input0.txt b/codeforces/SortTheSubarray/main_input0.txt
new file mode 100644
index 0000000..fbeb308
--- /dev/null
+++ b/codeforces/SortTheSubarray/main_input0.txt
@@ -0,0 +1,10 @@
+3
+7
+6 7 3 4 4 6 5
+6 3 4 4 7 6 5
+3
+1 2 1
+1 1 2
+3
+2 2 1
+2 1 2
diff --git a/codeforces/SortTheSubarray/main_output0.txt b/codeforces/SortTheSubarray/main_output0.txt
new file mode 100644
index 0000000..d54d580
--- /dev/null
+++ b/codeforces/SortTheSubarray/main_output0.txt
@@ -0,0 +1,3 @@
+2 5
+1 3
+2 3