[dynamic programming] Ji Suan Ke: Suan tou Jun breaks through the barrier (variant of the longest increasing subsequence)

The question ： Find the maximum value of the sum of increasing subsequences  

 dp[i]： With nums[i] The maximum value of the sum of increasing subsequences at the end
  initialization ：                 dp[0]=nums[0]

State transition equation ： dp[i]=max{dp[j]}+num[i] if（nums[j]<nums[i]） 0<=j<i

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