#include "stdafx.h"
#include <iostream>
#include <cstdlib>
#include <cmath>

using namespace std;

int one_max(int *in_mas, size_t in_dlina);
int one_max_recursia(int *in_mas, size_t in_dlina, int max, int i, int b, int a);

int min_rasnost_modul(int *in_mas, size_t in_dlina);
int min_rasnost_modul_recursia(int *in_mas, size_t in_dlina);


int main() {
    setlocale(0, "");
    int max;
    int mas1[] = { 1,2,3,4,5 };
    int mas2[] = { -9,8,4 };
    int mas3[] = { 2,2,8,8 };
    int mas4[] = {990, 61, 567891, 23, 213, 33, 29, 1000};
    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)
        &&
        (one_max_recursia(mas1, 5, max = mas1[0], 1, 0, 0) == 4)
        &&
        (one_max_recursia(mas2, 3, max = mas2[0], 1, 0, 0) == 1)
        &&
        (one_max_recursia(mas3, 4, max = mas3[0], 1, 0, 0) == 2)
        &&
        (min_rasnost_modul_recursia(mas1, 5) == 1)
        &&
        (min_rasnost_modul_recursia(mas2, 3) == 1)
        &&
        (min_rasnost_modul_recursia(mas3, 4) == 0)) {
        cout << "Good" << endl;

        cout << "Для min_rasnost_modul и mas4 = " << min_rasnost_modul_recursia(mas4, 8) << endl;
        cout << "Для min_rasnost_modul и mas4 = " << min_rasnost_modul(mas4, 8) << endl;
        return 0;
    }
    cout << "Bad" << endl;
    return 1;
}


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


int one_max_recursia(int *in_mas, size_t in_dlina, int max, int i, int b, int a) {
    if (i < in_dlina)
    {
        a = in_mas[i];
        if (a>max) {
            max = a;
            b = i;
        }
        return one_max_recursia(in_mas, in_dlina, max, ++i, b, a);
    }
    else return b;
}


int min_rasnost_modul(int *in_mas, size_t in_dlina) {
    int a = 0, min = 0;
    min = abs(abs(in_mas[1]) - abs(in_mas[0]));
    for (size_t 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 min_rasnost_modul_recursia(int *in_mas, size_t in_dlina) {
    if (in_dlina <= 1) {
        return abs(abs(in_mas[1]) - abs(in_mas[0]));
    }
    if (abs(abs(in_mas[1]) - abs(in_mas[0]) < min_rasnost_modul_recursia(in_mas + 1, in_dlina - 1)))
        return abs(abs(in_mas[1]) - abs(in_mas[0]));
    return min_rasnost_modul_recursia(in_mas + 1, in_dlina - 1);
}