5

#include "stdafx.h"
#include "conio.h"
#include "stdio.h"
#include "iostream"



int Max_after_zero(int i, int *dig, int n);
int Min_after_zero(int i, int *dig, int n);
int zero(int p, int n, int *dig);
void swap(int *max, int *min);
void Output(int n, int *dig);





void main()
{
int n, Max, Min, p=0, Zero;
int *dig;

printf("input n=\n");
scanf_s("%d", &n);

dig = (int*)malloc(n*sizeof(int));

for (int i = 0; i < n; i++)
{
scanf_s("%d", dig + i);
}

Zero=zero( p, n, dig);
Max = Max_after_zero(Zero,dig,n);
Min = Min_after_zero(Zero, dig, n);
swap(dig+Max, dig+Min);
Output( n, dig);

_getch();
}





int Max_after_zero(int i, int *dig, int n)
{
int j, maxJ;
int max = *(dig + i);

for (j = i; j < n; j++)
{
if (max < *(dig + j))
{
max = *(dig + j);
maxJ = j;
}
}

return maxJ;
}





int Min_after_zero(int i, int *dig, int n)
{
int j, minJ;
int min = *(dig + i);

for (j = i; j < n; j++)
{
if (min > *(dig + j))
{
min = *(dig + j);
minJ = j;
}
}

return minJ;
}

int zero(int p, int n, int *dig)
{

for (int i = 0; i < n; i++)
{
if (*(dig + i) == p)
return i;
}

}




void swap(int *max, int *min)
{
int c = *max;
*max = *min;
*min = c;
}




void Output(int n, int *dig)
{
for (int i = 0; i < n; i++)
{
printf("%d\n ", *(dig + i));
}
}