[leetcode] Number of Longest Increasing Subsequence

[leetcode] Number of Longest Increasing Subsequence 문제 링크 class Solution { public: int findNumberOfLIS(vector<int>& nums) { int n = nums.size(); if(!n) return 0; int dp[n+1]; int cnt[n+1]; for(int i=0; i<n+1; i++) {dp[i] = 1; cnt[i] = 1;} int cur = 0; for(int i=0; i<n; i++) { for(int j=0; j<i; j++) { if(nums[i] > nums[j]) { if(dp[i] < dp[j] + 1) { ...