AAAA!
  • 板块灌水区
  • 楼主love_lzx_and_Au
  • 当前回复10
  • 已保存回复10
  • 发布时间2024/8/7 14:52
  • 上次更新2024/8/7 15:47:08
查看原帖
AAAA!
1260410
love_lzx_and_Au楼主2024/8/7 14:52

求条!!!

#include<bits/stdc++.h>
using namespace std;
int a[10005], dp[10005];
int n;
int main () {
	cin >> n;
	for (int i = 1; i <= n; i ++) cin >> a[i];
	memset (dp, 1, sizeof dp);
	dp[0] = 0;
	for(int i = 1; i <= n; i ++) {
		for (int j = 0; j <= i; j ++) {
			if(a[i] > a[j]) dp[i] = max (dp[i], dp[j] + 1);
		}
	}
	cout << dp[n] << endl;
	return 0;
}
2024/8/7 14:52
加载中...