Advertisement
Guest User

Untitled

a guest
Jan 23rd, 2019
77
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.81 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. int a[100],l[100],t[100],n;
  4. void sir(int p)
  5. {
  6. cout<<a[p]<<" ";
  7. if(t[p]!=0)
  8. sir(t[p]);
  9. }
  10. int prop(int x)
  11. {
  12. return(x%2==0&&x>0);
  13. }
  14. int main()
  15. {
  16. int i,p,j,max;
  17. cin>>n;
  18. for(i=1;i<=n;i++)
  19. cin>>a[i];
  20. if(prop(a[n])==1)
  21. l[n]=1;
  22. else
  23. l[n]=0;
  24. for(i=n-1;i>=1;i--)
  25. {
  26. max=0;
  27. for(j=i+1;j<=n;j++)
  28. if(a[j]>a[i])
  29. if(l[j]>max)
  30. {
  31. max=l[j];
  32. p=j;
  33. }
  34. if(prop(a[i])==1)
  35. l[i]=max+1;
  36. else
  37. l[i]=max;
  38. t[i]=p;
  39. }
  40. max=0;
  41. for(i=1;i<=n;i++)
  42. if(l[i]>max)
  43. {
  44. max=l[i];
  45. p=i;
  46. }
  47. cout<<max<<"\n";
  48. sir(p);
  49. return 0;
  50. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement