1 条题解
-
0
C++ :
#include <iostream> using namespace std; int main(){ int n,a[110],i,c,j; cin>>n; for(i = 0;i < n;i++){ cin>>a[i]; } for(i = 0;i < n;i++){ c = 0; for(j = 0;j < i;j++){ if(a[j] < a[i]){ c++; } } cout<<c<<" "; } }Pascal :
var a:array[1..100000] of longint; i,j,s,b:longint; begin read(b); for i:=1 to b do read(a[i]); for i:=1 to b do begin for j:=1 to i-1 do if a[j]<a[i] then inc(s); write(s,' '); s:=0; end; end.Java :
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] a = new int[n]; for(int i =0;i<n;i++){ a[i] = sc.nextInt(); } getSum(a); } public static void getSum(int[] a){ for(int i = 0;i<a.length;i++){ int count = 0; for(int j = 0;j<i;j++){ if(a[i]>a[j]){ count ++; } } System.out.print(count+" "); } } }Python :
n=int(input()) a=list(map(int,input().split())) b=[0]*n for i in range(n): js=0 for j in range(i): if(a[j]<a[i]): js=js+1 b[i]=js for i in b: print(i,end=" ")
- 1
信息
- ID
- 439
- 时间
- 1000ms
- 内存
- 32MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者