#include <iostream>
using namespace std;
 
int findMax(int arr[], int n) {
    if (n == 1) {
        return arr[0]; 
    }
 
    int maxPrev = findMax(arr, n - 1);
 
    return (arr[n-1] > maxPrev) ? arr[n-1] : maxPrev; 
}
 
int main() 
{
    int arr[] = {5, -2, 13, 7, 9};
    int size = sizeof(arr) / sizeof(arr[0]);
 
    cout << "Елементи масиву: {5, -2, 13, 7, 9}" << endl;
    cout << "Максимальний елемент = " << findMax(arr, size) << endl;
 
    return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGZpbmRNYXgoaW50IGFycltdLCBpbnQgbikgewogICAgaWYgKG4gPT0gMSkgewogICAgICAgIHJldHVybiBhcnJbMF07IAogICAgfQoKICAgIGludCBtYXhQcmV2ID0gZmluZE1heChhcnIsIG4gLSAxKTsKCiAgICByZXR1cm4gKGFycltuLTFdID4gbWF4UHJldikgPyBhcnJbbi0xXSA6IG1heFByZXY7IAp9CgppbnQgbWFpbigpIAp7CiAgICBpbnQgYXJyW10gPSB7NSwgLTIsIDEzLCA3LCA5fTsKICAgIGludCBzaXplID0gc2l6ZW9mKGFycikgLyBzaXplb2YoYXJyWzBdKTsKCiAgICBjb3V0IDw8ICLQldC70LXQvNC10L3RgtC4INC80LDRgdC40LLRgzogezUsIC0yLCAxMywgNywgOX0iIDw8IGVuZGw7CiAgICBjb3V0IDw8ICLQnNCw0LrRgdC40LzQsNC70YzQvdC40Lkg0LXQu9C10LzQtdC90YIgPSAiIDw8IGZpbmRNYXgoYXJyLCBzaXplKSA8PCBlbmRsOwoKICAgIHJldHVybiAwOwp9