2015 ACM/ICPC Asia Regional Shenyang Online(1002)

来源：互联网发布：淘宝代付关闭怎么回事编辑：程序博客网时间：2024/05/22 07:56

Largest Point

Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 294 Accepted Submission(s): 144

Problem Description

Given the sequence

A with

n integers

t1,t2,⋯,tn. Given the integral coefficients

a and

b. The fact that select two elements

ti and

tj of

A and

i≠j to maximize the value of

at2i+btj, becomes the largest point.

Input

An positive integer

T, indicating there are

T test cases.
For each test case, the first line contains three integers corresponding to

n (2≤n≤5×106), a (0≤|a|≤106) and

b (0≤|b|≤106). The second line contains

n integers

t1,t2,⋯,tn where

0≤|ti|≤106 for

1≤i≤n.

The sum of

n for all cases would not be larger than

5×106.

Output

The output contains exactly

T lines.
For each test case, you should output the maximum value of

at2i+btj.

Sample Input

23 2 11 2 35 -1 0-3 -3 0 3 3

Sample Output

Case #1: 20Case #2: 0

Source

2015 ACM/ICPC Asia Regional Shenyang Online

其实是一个简单题，把情况分好就可以了。

当a>0时取t数组中最大的数或者最小的数,即数组中绝对值最大的数

当a<0时取t数组中最接近0的数

当b>0时取t数组中最大的数

当b<0时取t数组中最小的数

0 0