✅ 状态压缩动态规划

longest-decreasing-subsequence/main.cc

@@ -3,13 +3,13 @@ using namespace std;
 #define MAXN 10005
 #define M 200
 int dp[MAXN];
-int arr[M];
+int obstacle[M];
 int longest_decreasing_subsequence(int n) {
   int maximun = 0;
   for (int i = 0; i < n; i++) {
     dp[i]++;
     for (int j = 0; j < i; j++) {
-      if (arr[j] > arr[i]) // 最大上升为 `arr[j] < arr[i]`
+      if (obstacle[j] > obstacle[i]) // 最大上升为 `obstacle[j] < obstacle[i]`
         dp[i] = max(dp[i], dp[j] + 1);
     }
     if (dp[i] > maximun)
@@ -21,7 +21,7 @@ int main() {
   int N;
   cin >> N;
   for (int i = 0; i < N; i++) {
-    cin >> arr[i];
+    cin >> obstacle[i];
   }
   int value = longest_decreasing_subsequence(N);
   cout << value << endl;