#include?
#define?MAX_SIZE?10
typedef?struct?Node?Node;
struct?Node{
	int?data;
	int?index;
};

int?tree[MAX_SIZE]?=?{0};

int?main（）?{
	void?bubbleSort（Node?*arr?int?len）;
	void?update（int?idx?int?value）;
	int?getSum（int?idx）;

	//?9?1?0?5?4
	Node?node[MAX_SIZE];
	int?discreted[MAX_SIZE];
	//?int?discreted[MAX_SIZE]?=?{5?2?1?4?3};
	int?n?i?j?result?=?0;
	printf（“%s\n“?“請輸入測試用例個數：（例：5）“）;
	scanf（“%d“?&n）;
	printf（“%s\n“?“請輸入測試用例：（例：91054）“）;
	for（i?=?0;?i?		scanf（“%d“?&node[i].data）;
		node[i].index?=?i;
	}

	bubbleSort（node?n）;

	//?離散化數組
	for（i?=?1;?i?<=?n;?i++）?{
		discreted[node[i?-?1].index]?=?i;
	}
????printf（“離散后數組：“）;
	for（i?=?0;?i?		printf（“%d??“discreted[i]）;
	}

	for（i?=?1?;?i?		update（discreted[i]?1）;
		result?+=?（i?+?1）?-?getSum（discreted[i]）;