Breaking News: Grepper is joining You.com. Read the official announcement!

longest increasing subsequence using dp

Depressed Dugong answered on September 29, 2023 Popularity 6/10 Helpfulness 1/10

answer longest increasing subsequence using dp

longest increasing subsequence using dp

Comment

#include <bits/stdc++.h>
using namespace std;

const int N = 10010;
int n;
int arr[N];
int dp[N];

int lis() {
    int max_length = 1;
    for (int i = 0; i < n; i++) {
        dp[i] = 1;
        for (int j = 0; j < i; j++) {
            if (arr[i] > arr[j]) {
                dp[i] = max(dp[i], dp[j] + 1);
            }
        }
        max_length = max(max_length, dp[i]);
    }
    return max_length;
}

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
    int result = lis();
    cout << result << endl;
    return 0;
}

Popularity 6/10 Helpfulness 1/10 Language cpp

Source: chat.openai.com

Tags: c++ subsequence using

Link to this answer
Share Copy Link

Contributed on Sep 29 2023

Depressed Dugong

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

longest increasing subsequence using dp

Contents

More Related Answers

longest increasing subsequence using dp

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.