AZEN-SGG/MSUStudentWork
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Сделал 43ю Задачу с Массивами

Browse source
This commit is contained in:
AZEN-SGG 2024-11-03 09:23:57 +03:00
parent 4e498f2819
commit baa0509a01
7 changed files with 144 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

30
WorkingArrays/43Ex/max_distance.c Normal file
View file

@ -0,0 +1,30 @@
#include "max_distance.h"
int maxDistance(double * array, int length) {
int end_first_min, start_last_min, len_local;
end_first_min = 0;
start_last_min = 0;
len_local = 1;
for (int i = 1; i < length; ++i) {
if (len_local != OUT) {
if ((array[i] - array[i - 1]) < -exp) {
len_local = 1;
} else if ((array[i] - array[i - 1]) > exp) {
if (end_first_min == OUT) end_first_min = i;
else if (start_last_min == OUT) start_last_min = i - len_local;
len_local = 0;
} else {++len_local;}
} else {
if ((array[i] - array[i - 1]) < -exp) len_local = 1;
}
}
if (len_local != OUT) start_last_min = length - len_local;
if (end_first_min == 0) return NO_LOCAL_MINIMA;
else if (start_last_min == 0) return ONE_LOCAL_MINIMUM;
else return start_last_min - end_first_min;
}