Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int subsir_crescator (int n, int v[])
- {
- int vc[100], sc[100];
- for (int i = 1; i <= n; i++)
- {
- int j = i - 1;
- while (j > 1 && v[j] > v[i])
- {
- j--;
- }
- if (j != 0)
- vc[i] = vc[j] + 1;
- else
- vc[1] = 1;
- if (i != 1)
- {
- int val = sc[i - 1];
- int l = j;
- int k = 0;
- while (sc[j] == val && j > 0 && vc[j] == vc[l])
- {
- k += sc[j];
- j--;
- }
- sc[i] = k;
- }
- else
- sc[i] = 1;
- }
- }
- int main()
- {
- int v[100], vc[100], sc[100];
- int n;
- cin >> n;
- for (int i = 1; i <= n; i++)
- cin >> v[i];
- subsir_crescator(n, v);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement