题解 | #Redraiment的走法#
Redraiment的走法
https://www.nowcoder.com/practice/24e6243b9f0446b081b1d6d32f2aa3aa
// HJ103-2 Redraiment的走法.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。 #include<bits/stdc++.h> #include<bits/stdc++.h> using namespace std; int main() { int n; while (cin >> n) { vector<int>dp(n, 0); vector<int>res(dp.size(), 1); for (int i = 0; i < n; i++) { cin >> dp[i]; } int ans = 0; for (int i = 1; i < dp.size(); i++) { for (int j = 0; j < i; j++) { if (dp[j] < dp[i]) { res[i] = max(res[i], res[j] + 1); } } if (ans < res[i]) { ans = res[i]; } } cout << ans << endl; } return 0; }