Advertisement
Guest User

Untitled

a guest
Oct 14th, 2019
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.85 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int subsir_crescator (int n, int v[])
  6. {
  7. int vc[100], sc[100];
  8. for (int i = 1; i <= n; i++)
  9. {
  10. int j = i - 1;
  11. while (j > 1 && v[j] > v[i])
  12. {
  13. j--;
  14. }
  15. if (j != 0)
  16. vc[i] = vc[j] + 1;
  17. else
  18. vc[1] = 1;
  19. if (i != 1)
  20. {
  21. int val = sc[i - 1];
  22. int l = j;
  23. int k = 0;
  24. while (sc[j] == val && j > 0 && vc[j] == vc[l])
  25. {
  26. k += sc[j];
  27. j--;
  28.  
  29. }
  30. sc[i] = k;
  31. }
  32. else
  33. sc[i] = 1;
  34.  
  35. }
  36. }
  37.  
  38. int main()
  39. {
  40. int v[100], vc[100], sc[100];
  41. int n;
  42. cin >> n;
  43. for (int i = 1; i <= n; i++)
  44. cin >> v[i];
  45. subsir_crescator(n, v);
  46. return 0;
  47. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement