-
Notifications
You must be signed in to change notification settings - Fork 73
/
Copy pathLISeven.cpp
64 lines (59 loc) · 949 Bytes
/
LISeven.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <bits/stdc++.h>
using namespace std;
int main()
{
int ara[]={1,2,3,4,5,7,8};
int lis[]={1,1,1,1,1,1,1};
int n=7;
int max=1;
int lastindex=n-1;
for(int i=1;i<n;i++)
{
cout<<"Step "<<i<<": ";
for(int i=0;i<n;i++)
cout<<lis[i]<<" ";
cout<<endl;
if(ara[i]%2==1)
continue;
for(int j=0;j<i;j++)
{
if(ara[j]%2==1)
continue;
if(ara[j]<ara[i] && lis[j]+1>lis[i])
{
lis[i]=lis[j]+1;
if(lis[i]>max){
max=lis[i];
lastindex=i;
}
}
}
}
cout<<"Step "<<n<<": ";
for(int i=0;i<n;i++)
cout<<lis[i]<<" ";
cout<<endl;
cout<<endl;
cout<<"LIS ARRAY: ";
for(int i=0;i<n;i++)
cout<<lis[i]<<" ";
cout<<endl;
cout<<endl;
cout<<"LIS: ";
cout<<max<<endl;
vector<int>vec;
int i=lastindex;
while(max>0)
{
if(lis[i]==max &&ara[i]%2==0)
{
max--;
vec.push_back(ara[i]);
}
i--;
}
for(int i=vec.size()-1;i>=0;i--)
cout<<vec[i]<<" ";
cout<<endl;
return 0;
}