C++逆序数查找与输出
#include
using namespace std;
int main() {
int a[100][100];
int n;
cin >> n;
int b[100];
int c[100];
int flag=0;
for (int i = 1; i <= n; i++)
{
cin >> b[i];
c[i] = b[i];
}
for (int i = 1; i <= n; i++)
for (int j = i+1; j <= n; j++)
{
if (b[i] > c[j])
a[i][j] = 1;
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
{
if (a[i][j] == 1) {
flag = flag + 1;
cout << "<" << b[i] << "," << b[j] << ">";
}
}
cout << "逆序数有:" << flag << "个";
return 0;
}