请帮忙了解这道题 正确代码的思路（不是要求理解题目）
请帮忙理解这道题 正确代码的思路（不是要求理解题目）
#include <iostream>
using namespace std;
int a[111],n,x,y,res;
int main (){
cin>>n;
for(int i=0; i<n; i++){
cin>>a[i];
if(a[i]>a[x]) //这里看不懂
x=i;
if(a[i]<=a[y]) //这里看不懂
y=i;
}
cout<<n-y-1+x-(y<x)<<endl; //这里……看不懂
}
还有y<x是什么意思？
题目：
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the military charter the soldiers should stand in the order of non-increasing of their height. But as there's virtually no time to do that, the soldiers lined up in the arbitrary order. However, the general is rather short-sighted and he thinks that the soldiers lined up correctly if the first soldier in the line has the maximum height and the last soldier has the minimum height. Please note that the way other solders are positioned does not matter, including the case when there are several soldiers whose height is maximum or minimum. Only the heights of the first and the last soldier are important.
For example, the general considers the sequence of heights (4, 3, 4, 2, 1, 1) correct and the sequence (4, 3, 1, 2, 2) wrong.
Within one second the colonel can swap any two neighboring soldiers. Help him count the minimum time needed to form a line-up which the general will consider correct.
Input
The first input line contains the only integer n (2 ≤ n ≤ 100) which represents the number of soldiers in the line. The second line contains integers a1, a2, ..., an (1 ≤ ai ≤ 100) the values of the soldiers' heights in the order of soldiers' heights' increasing in the order from the beginning of the line to its end. The numbers are space-separated. Numbers a1, a2, ..., an are not necessarily different.
Output
Print the only integer — the minimum number of seconds the colonel will need to form a line-up the general will like.
Sample test(s)
input
4
33 44 11 22
output
2
input
7
10 10 58 31 63 40 76
output
10
Note
In the first sample the colonel will need to swap the first and second soldier and then the third and fourth soldier. That will take 2 seconds. The resulting position of the soldiers is (44, 33, 22, 11).
In the second sample the colonel may swap the soldiers in the following sequence:
(10, 10, 58, 31, 63, 40, 76)
(10, 58, 10, 31, 63, 40, 76)
(10, 58, 10, 31, 63, 76, 40)
(10, 58, 10, 31, 76, 63, 40)
(10, 58, 31, 10, 76, 63, 40)
(10, 58, 31, 76, 10, 63, 40)
(10, 58, 31, 76, 63, 10, 40)
(10, 58, 76, 31, 63, 10, 40)
(10, 76, 58, 31, 63, 10, 40)
(76, 10, 58, 31, 63, 10, 40)
(76, 10, 58, 31, 63, 40, 10)
------解决思路----------------------
英文较菜，理解得不对的地方还请多多指教。
这题是要求找出一组给定数据中的最大值和最小值，然后把最大值移动到队前，把最小值移动到队尾。不要求队中的数据有序。
要求的是移动的最小次数（每次移动只能是相临的两个数交换）。
方法是找出最大值和最小值的位置，n-y-1是最小值往队尾方向移动的次数，x是最大值往队头移动的次数。
如果
#include <iostream>
using namespace std;
int a[111],n,x,y,res;
int main (){
cin>>n;
for(int i=0; i<n; i++){
cin>>a[i];
if(a[i]>a[x]) //这里看不懂
x=i;
if(a[i]<=a[y]) //这里看不懂
y=i;
}
cout<<n-y-1+x-(y<x)<<endl; //这里……看不懂
}
还有y<x是什么意思？
题目：
A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.
By the military charter the soldiers should stand in the order of non-increasing of their height. But as there's virtually no time to do that, the soldiers lined up in the arbitrary order. However, the general is rather short-sighted and he thinks that the soldiers lined up correctly if the first soldier in the line has the maximum height and the last soldier has the minimum height. Please note that the way other solders are positioned does not matter, including the case when there are several soldiers whose height is maximum or minimum. Only the heights of the first and the last soldier are important.
For example, the general considers the sequence of heights (4, 3, 4, 2, 1, 1) correct and the sequence (4, 3, 1, 2, 2) wrong.
Within one second the colonel can swap any two neighboring soldiers. Help him count the minimum time needed to form a line-up which the general will consider correct.
Input
The first input line contains the only integer n (2 ≤ n ≤ 100) which represents the number of soldiers in the line. The second line contains integers a1, a2, ..., an (1 ≤ ai ≤ 100) the values of the soldiers' heights in the order of soldiers' heights' increasing in the order from the beginning of the line to its end. The numbers are space-separated. Numbers a1, a2, ..., an are not necessarily different.
Output
Print the only integer — the minimum number of seconds the colonel will need to form a line-up the general will like.
Sample test(s)
input
4
33 44 11 22
output
2
input
7
10 10 58 31 63 40 76
output
10
Note
In the first sample the colonel will need to swap the first and second soldier and then the third and fourth soldier. That will take 2 seconds. The resulting position of the soldiers is (44, 33, 22, 11).
In the second sample the colonel may swap the soldiers in the following sequence:
(10, 10, 58, 31, 63, 40, 76)
(10, 58, 10, 31, 63, 40, 76)
(10, 58, 10, 31, 63, 76, 40)
(10, 58, 10, 31, 76, 63, 40)
(10, 58, 31, 10, 76, 63, 40)
(10, 58, 31, 76, 10, 63, 40)
(10, 58, 31, 76, 63, 10, 40)
(10, 58, 76, 31, 63, 10, 40)
(10, 76, 58, 31, 63, 10, 40)
(76, 10, 58, 31, 63, 10, 40)
(76, 10, 58, 31, 63, 40, 10)
------解决思路----------------------
英文较菜，理解得不对的地方还请多多指教。
这题是要求找出一组给定数据中的最大值和最小值，然后把最大值移动到队前，把最小值移动到队尾。不要求队中的数据有序。
要求的是移动的最小次数（每次移动只能是相临的两个数交换）。
方法是找出最大值和最小值的位置，n-y-1是最小值往队尾方向移动的次数，x是最大值往队头移动的次数。
如果