Code:
void fnNhapMang(int a[], int n)
{
if(n < 1) return;
for (int i = 0; i < n; i++)
{
do
{
printf("Nhap a[%d]: ", i + 1);
scanf(" %d", &a[i]);
}while((a[i] % 2 == 0 && !fnKT_ChanTang(a, i, a[i])) || (a[i] %2 != 0 && !fnKT_LeGiam(a, i, a[i])));
}
}
int fnKT_ChanTang(int a[], int n, int x)
{
for(int i = n - 1; i >= 0; i--)
if(a[i] % 2 == 0 && x < a[i]) return 0;
return 1;
}
int fnKT_LeGiam(int a[], int n, int x)
{
for(int i = n - 1; i >= 0; i--)
if(a[i] % 2 != 0 && x > a[i]) return 0;
return 1;
}