/*
Napisz funkcje, która sprawdzi czy w danej tablicy n liczb calkowitych liczby nieparzyste sa uporzadkowane niemalejaco.

Przyklad. Dla n = 8, dla tablic [1, 8, 15, 19, 2, 21, 28, 29], [4, 6, 8, 1, 10, 11, 14, 11], [4, 6, 18, 10, 12, 4, 6, 20], funkcja powinna zwrócic 1, a dla tablicy [33, 8, 12, 18, 2022, 8, 31] funkcja powinna zwrócic 0.
*/

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

int f(int A[], int n) {
    int prev=0;
    for(int i =0;i<n; ++i)
        if(A[i]%2==1 && prev!=0 && A[i]<prev) return 0;
        else if (A[i]%2==1) prev = A[i];
    return 1;
}

int f2(int A[], int n) {
    int last_np=0;
    int first_np_seen=0;
    for (int i =0; i<n; ++i){
        if(A[i]%2==0) continue;
        if(first_np_seen==0){
            first_np_seen = 1;
            last_np = A[i];}
        else {
            if(A[i]<last_np) return 0;
            last_np=A[i];
            }
        }
    return 1;
}


int main() {

    int sortedArray1[] = {1, 8, 15, 19, 2, 21, 28, 29}; //1
    //int sortedArray1[] = {1, 1, 8, 15, 19, 2, 21, 28, 29}; //1
    //int sortedArray1[] = {-3, -1, 1, 3, 4, -6, -2, 8, 9}; //0
    int sortedArray2[] = {4, 6, 8, 1, 10, 11, 14, 11};  //1
    int sortedArray3[] = {4, 6, 18, 10, 12, 4, 6, 20};  //1
    int sortedArray4[] = {33, 8, 12, 18, 2022, 8, 31};  //0
    //int sortedArray4[] = {33, 33, 35, 18, 2022, 8, 37};  //1

    int size1 = sizeof(sortedArray1) / sizeof(sortedArray1[0]);
    int size2 = sizeof(sortedArray2) / sizeof(sortedArray2[0]);
    int size3 = sizeof(sortedArray3) / sizeof(sortedArray3[0]);
    int size4 = sizeof(sortedArray4) / sizeof(sortedArray4[0]);

    printf("%d\n", f(sortedArray1, size1));
    printf("%d\n", f(sortedArray2, size2));
    printf("%d\n", f(sortedArray3, size3));
    printf("%d\n", f(sortedArray4, size4));
    return 0;
}