UVa1260 - Sales

最新推荐文章于 2021-03-18 23:22:22 发布

kgduu

最新推荐文章于 2021-03-18 23:22:22 发布

阅读量786

点赞数

CC 4.0 BY-SA版权

分类专栏： OJ

本文链接：https://blog.youkuaiyun.com/xiexingshishu/article/details/34993797

OJ 专栏收录该内容

986 篇文章

订阅专栏

本文探讨了CozyWalk公司CEO使用每日销售报告进行趋势分析的方法，并通过算法计算过去销售金额低于或等于当前金额的天数，从而形成趋势列表。通过分析这个列表，可以总结出销售趋势并进行预测。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Mr. Cooper, the CEO of CozyWalk Co., receives a report of daily sales every day since the company has been established. Starting from the second day since its establishment, on receiving the report, he compares it with each of the previous reports in order to calculate the number of previous days whose sales amounts are less than or equal to it. After obtaining the number of such days, he writes it in a list.

This problem can be stated more formally as follows. Let A = (a₁, a₂,..., a_n) denote the list of daily sales amounts. And let B = (b₁, b₂,..., b_n-1) be another integer list maintained by Mr. Cooper, each value representing the number of such previous days. On the i-th day (2 $\le$ i $\le$ n), he calculates b_i-1, the number of a_k's such that a_k $\le$ a_i (1 $\le$ k < i).

For example, suppose that A = (20, 43, 57, 43, 20). For the fourth day's sales amount, a₄ = 43, the number of previous days whose sales amounts are less than or equal to it is 2 since a₁ $\le$ a₄, a₂ $\le$ a₄, and a₃ > a₄. Therefore, b₃ = 2. Similarly, b₁, b₂, and b₄ can be obtained and it results in B = (1, 2, 2, 1).

Given an array of size n for the list of daily sales amounts, write a program that prints the sum of the n - 1 integers in the list B.

Input

Your program is to read the input from standard input. The input consists of T test cases. The number of test cases T is given in the first line of the input. Each test case starts with a line containing an integer n (2 $\le$ n $\le$ 1, 000), which represents the size of the list A . In the following line, n integers are given, each represents the daily sales amounts a_i (1 $\le$ a_i $\le$ 5, 000 and 1 $\le$ i $\le$ n) for the test case.

Output

Your program is to write to standard output. For each test case, print the sum of the n - 1 integers in the list B which is obtained from the list A.

The following shows sample input and output for two test cases.

Sample Input

2
5
38 111 102 111 177
8
276 284 103 439 452 276 452 398

Sample Output

9
20

#include <cstdio>

using namespace std;

const int N = 1010;

int a[N], b[N];
int n;

void input();
void solve();

int main()
{
	#ifndef ONLINE_JUDGE
		freopen("d:\\OJ\\uva_in.txt", "r", stdin);
	#endif
	
	int t;
	scanf("%d", &t);
	
	while (t--) {
		input();
		solve();
	}
	
	return 0;
}

void input()
{
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf("%d", &a[i]);
	}
}

void solve()
{
	for (int i = 1; i < n; i++) {
		int cnt = 0;
		for (int j = 0; j < i; j++) {
			if (a[j] <= a[i]) cnt++;
		}
		b[i - 1] = cnt;
	}
	
	int ans = 0;
	for (int i = 0; i < n - 1; i++) {
		ans += b[i];
	}
	
	printf("%d\n", ans);
}