Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- pair<int,int> minmax(int t[], int n)
- {
- if (n==1) return make_pair(t[0],t[0]);
- int p =n/2;
- pair<int,int> lewy = minmax(t,p);
- pair<int,int> prawy = minmax(t+p,n-p);
- return make_pair(min(lewy.first, prawy.first), max(lewy.second, prawy.second));
- }
- int main()
- {
- int n;
- cin >> n;
- int tab[n];
- for (int i=0;i<n;i++)
- cin >> tab[i];
- pair<int,int> wynik = minmax(tab,n);
- cout << wynik.first << ' ' << wynik.second << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement