Advertisement
Guest User

Untitled

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