最长上升子序列
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, maximun = INT_MIN, a[505], dp[505];
cin >> n;
for(int i = 0;i < n;i++) {
cin >> a[i];
dp[i] = 1;
}
for(int i = 0;i < n;i++) {
for(int j = i-1;j >= 0;j--)
if(a[j] < a[i]) {
dp[i] = max(dp[j]+1, dp[i]);
break;
}
maximun = max(maximun, dp[i]);
}
cout << maximun << endl;
return 0;
}
The road of your choice, you have to go on !
粤ICP备16082171号-1
登录后发布评论
请问为什么需要break呀