fork download
copy 
  1. //
  2. //  main.cpp
  3. //  Longest Increasing Subsequence (LIS)
  4. //
  5. //  Created by Himanshu on 17/09/21.
  6. //
  7.  
  8. #include <iostream>
  9. using namespace std;
  10. const int N = 8;
  11.  
  12. void LIS (int A[]) {
  13.     int LIS[N], sol = 1;
  14.  
  15.  
  16.     for (int i=0; i<N; i++) {
  17.         LIS[i] = 1;
  18.         for (int j=0; j<i; j++) {
  19.             if (A[i] > A[j] && LIS[i] < LIS[j]+1) {
  20.                 LIS[i] = LIS[j] + 1;
  21.             }
  22.         }
  23.         sol = max(sol, LIS[i]);
  24.     }
  25.  
  26.     cout<<"Length of Longest Increasing Subsequence (LIS) is: "<<sol<<endl;
  27.  
  28. }
  29.  
  30. int main() {
  31.     int A[N] = {10,9,2,5,3,7,101,18};
  32.     LIS(A);
  33. }
  34.  
Success #stdin #stdout 0.01s 5444KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Length of Longest Increasing Subsequence (LIS) is: 4
https://ideone.com/SpZbqL
language:
C++ 4.3.2 (gcc-4.3.2)
created:
3 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!