#include "stdafx.h"
#include <iostream>
#include <cstdlib>
#include <ctime>
#include<cstring>

using namespace std;


int one_max(int *in_mas, size_t in_dlina) {
    int a = 0, max = 0, b = 0;
    max = in_mas[0];
    for (int i = 1; i < (in_dlina); i++) {
        a = in_mas[i];
        if (a>max) {
            max = a;
            b = i;
        }

    }
    return b;
}
int one_maxrecursia(int *in_mas, size_t in_dlina, int max) {
    static int a = 0, b = 0;
    //for (int i = 1; i < (in_dlina); i++) {
    if (in_dlina > 1){
        a = in_mas[in_dlina];
        if (a>max) {
            max = a;
            b = in_dlina;
        }
        return one_maxrecursia(in_mas, --in_dlina, max);
    }
    else
        return max;
}


int min_rasnost_modul(int *in_mas, unsigned int in_dlina) {
    int a = 0, min = 0;
    min = abs(abs(in_mas[1]) - abs(in_mas[0]));
    for (int i = 1; i < (in_dlina - 1); i++) {
        a = abs(abs(in_mas[i + 1]) - abs(in_mas[i]));
        if (a<min)
            min = a;
    }
    return min;
}

int main() {
    setlocale(0, "");
    int mas1[] = { 1,2,3,4,5 };
    int mas2[] = { -9,8,4 };
    int mas3[] = { -2,2,8,8 };
    if (
        (one_max(mas1, 5) == 4)
        &&
        (one_max(mas2, 3) == 1)
        &&
        (one_max(mas3, 4) == 2)
        &&
        (min_rasnost_modul(mas1, 5) == 1)
        &&
        (min_rasnost_modul(mas2, 3) == 1)
        &&
        (min_rasnost_modul(mas3, 4) == 0))
    {
        cout << "Good" << endl;
        return 0;
    }
    cout << "Bad" << endl;

    cout << (one_maxrecursia(mas1, 5, mas1[0])) << endl;
    cout << (one_maxrecursia(mas2, 3, mas2[0])) << endl;
    cout << (one_maxrecursia(mas3, 4, mas3[0])) << endl;

    return 1;
}