这样看着舒服点 然而还能更简单(bushi 这还不是最简单的 最简单的如下

#include <iostream> #include <cmath> #include <algorithm> using namespace std; int main() { int n; int a[1100], f[1100], ans = 0; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; f[i] = 1; } for (int i = 2; i <= n; i++) for (int j = 1; j < i; j++) if (a[j] < a[i]) f[i] = max(f[i], f[j] + 1); for (int i = 1; i <= n; i++) ans = max(ans, f[i]); cout << ans; }

这个看着舒服点

#include<bits/stdc++.h> using namespace std; int n,a[200005],dp[200005],big=INT_MIN,x; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; dp[i]=1; } for(int i=1;i<=n;i++){ for (int j = 1; j < i; j++){ if(a[j]<a[i])dp[i] = max(dp[i], dp[j] + 1); big=max(dp[i],big);}} }

#include <bits/stdc++.h> using namespace std; int n; int a[1007]; int dp[1007]; int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } int ans = 0; for (int i = 1; i <= n; i++) { dp[i] = 1; for (int j = 1; j <= i; j++) { if (a[j] < a[i]) { dp[i] = max(dp[i], dp[j] + 1); } } ans = max(ans, dp[i]); } cout << ans << endl; }