总时间限制:
1000ms
内存限制:
65536kB
描述
Given a sequence S of N numbers. How many pairs of indexes I and J are there satisfying that I is less than J and S[i] is greater than S[J]?
输入
First line: one positive integers N (N <= 100).
Second line: N positive integers (<= 1000).
输出
One integer.
样例输入
5 4 2 5 3 1
样例输出
7
依个从前住后比较就可。
#include<bits/stdc++.h>//Writed by Wangzhimin Date: 2022.06.02
using namespace std;
int num,k,a[205];
int main()
{
scanf("%d",&num);
int cnt=0;
for(int i=0;i<num;i++)
scanf("%d",&a[i]);
for(int i=0;i<num-1;i++)
for(int j=i+1;j<num;j++)
{
if(a[i]>a[j])//是要求的吧
cnt++;
}
cout<<cnt;
return 0;
}