[dynamic programming] Jisuan Ke: Jumping stake (variant of the longest increasing subsequence)

There is a row in front of you n A stake , The heights of the wooden piles are h1,h2,h3…hn. Garlic can jump to any stake in the first step , The garlic can't jump back at the next step, but can only jump forward , And jump down to the height of a stake No more than Current stake . Mr. garlic hopes to step on as many stakes as possible , Please help garlic calculate , How many stakes can you step on at most . 
Input format  
Enter an integer in the first line n Represents the number of wooden piles . Second line input n It's an integer h1,h2,h3..hn, Represent the n The height of a stake .(1≤n≤1000,1≤hi≤100000) 
Output format  
Output an integer , Represents the maximum number of wooden piles that can be stepped on , Occupy a line . 
The sample input  
6 
3 6 4 1 4 2 
Sample output  
4

The question ： Find the length of the longest non increasing subsequence of a group of numbers

dp[i] Said to nums[i] Length of the longest non increasing subsequence at the end

initialization ： dp[0]=0

State transition equation ：dp[i]=max{dp[j]}+1,if(nums[j]>=nums[i]) 0<=j<i

Code ：

#include<iostream>
using namespace std;
int nums[100];
int dp[100];
int n;
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>nums[i];
	}
	dp[0]=nums[0];
    int res=INT_MAX;
	for(int i=0;i<n;i++){
		for(int j=0;j<i;j++){
			if(nums[j]>=nums[i])
			dp[i]=max(dp[i],dp[j]+1);
            res=max(res,dp[i]);
		}
	}
	cout<<res;
}