ZZULIOJ: 1120: the most value to exchange

1120: max swap

Time limit: 1 Sec Memory limit: 128 MB
[Status] [Discussion Board] [Submit] [Submit by:admin]

Title description

There is a sequence of integers of length n.Write a program that swaps the minimum value with the first number in a sequence, and then swaps the maximum value with the last number.Output the converted sequence.Write two functions MinIndex() and MaxIndex() to calculate the minimum and maximum subscripts, respectively.

int MinIndex(int ​​a[], int n); //The function returns the index of the smallest element in the array a

int MaxIndex(int ​​a[], int n); //The function returns the index of the largest element in the array a

The output of the array elements calls the function PrintArr().

Enter

The input consists of two lines.
The first line is a positive integer n (1≤n≤10).
The second line is a sequence of n positive integers to ensure that there are no repeated elements.

Output

Output the converted sequence.Separate the data with spaces.

Sample input Copy

55 4 1 2 3

Sample output Copy

1 4 3 2 5

Reference Code

#include #include void PrintArr(int a[], int n);int MinIndex(int ​​a[], int n);int MaxIndex(int ​​a[], int n);int insert(int a[], int n, int num);int main(){int a[10], n, i, j, b;scanf("%d", &n);for(i=0;ic){c=a[i];m=i;}}return m;}void PrintArr(int a[], int n){int i;for(i=0;i