Merge branch 'main' of github.com:iagorrr/Competitive-Programming-Alg…

…orithms

algorithms/dynamic-programming/longest-increasing-subsequence.cpp

@@ -1,44 +1,43 @@
-template<typename T>
+template <typename T>
 pair<int, vector<int>> lis(const vector<T> &xs) {
-	int n = xs.size();
+  int n = xs.size();
 
-	vector<T> dp(n+1, numeric_limits<T>::max());
-	dp[0] = numeric_limits<T>::min();
+  vector<T> dp(n + 1, numeric_limits<T>::max());
+  dp[0] = numeric_limits<T>::min();
 
-	int sz = 0;
-	vector<int> psx(n);
+  int sz = 0;
+  vector<int> psx(n);
 
-	for (int i = 0; i < n; i++) {
-		auto it = lower_bound(dp.begin(), dp.end(), xs[i]);
-		auto pos = (int)(it - dp.begin());
+  for (int i = 0; i < n; i++) {
+    auto it = lower_bound(dp.begin(), dp.end(), xs[i]);
+    auto pos = (int)(it - dp.begin());
 
-		sz = max(sz, pos);
+    sz = max(sz, pos);
 
-		dp[pos] = xs[i];
+    dp[pos] = xs[i];
 
-		psx[i] = pos;
-	}
+    psx[i] = pos;
+  }
 
-	return {sz, psx};
+  return {sz, psx};
 }
 
-template<typename T>
+template <typename T>
 vector<int> get_idx(vector<T> xs) {
-	auto [sz1, psx1] = lis(xs);
+  auto [sz1, psx1] = lis(xs);
 
-	reverse(xs.begin(), xs.end());
-	for (auto &xi : xs) xi = -xi;
+  reverse(xs.begin(), xs.end());
+  for (auto &xi : xs) xi = -xi;
 
-	auto [sz2, psx2] = lis(xs);
+  auto [sz2, psx2] = lis(xs);
 
-	vector<int> ans;
-	int _n = xs.size();
-	for (int i = 0; i < _n; i++) {
-		int l = psx1[i];
-		int r = psx2[_n-i-1];
-		if (l + r -1 == sz1) ans.push_back(i);
-	}
-
-	return ans;
+  vector<int> ans;
+  int _n = xs.size();
+  for (int i = 0; i < _n; i++) {
+    int l = psx1[i];
+    int r = psx2[_n - i - 1];
+    if (l + r - 1 == sz1) ans.push_back(i);
+  }
 
+  return ans;
 }