Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int n;
- scanf("%d", &n);
- int a[n+2];
- for(int i=0;i<n;i++){
- scanf("%d", &a[i]);
- }
- int lis[n+2];
- int tra[n+2];
- for(int i=0;i<n;i++) lis[i]=1;
- for(int i=0;i<n;i++) tra[i]=-1;
- for(int i=0;i<n-1;i++){
- for(int j=i+1;j<n;j++){
- if(a[j]>a[i]){
- if((lis[i]+1)>lis[j]){
- lis[j]++;
- tra[j]=i;
- }
- }
- }
- }
- int mx=0;
- int idx;
- for(int i=0;i<n;i++){
- if(lis[i]>mx){
- mx=lis[i];
- idx=i;
- }
- }
- printf("Length of LIS %d\n", mx);
- int v[11111];
- int vi=0;
- while(1){
- if(idx==-1) break;
- v[vi]=a[idx];
- vi++;
- idx=tra[idx];
- }
- for(int i=vi-1;i>=0;i--){
- printf("%d ", v[i]);
- }
- printf("\n");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement