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 .
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 .
For each test case, you should output the maximum value of at2i+btj .
Sample Input
2 3 2 1 1 2 3 5 -1 0 -3 -3 0 3 3
Sample Output
Case #1: 20 Case #2: 0
Source
其实是一个简单题,把情况分好就可以了。
当a>0时取t数组中最大的数或者最小的数,即数组中绝对值最大的数
当a<0时取t数组中最接近0的数
当b>0时取t数组中最大的数
当b<0时取t数组中最小的数
#include
#include
#include
#include
#include
using namespace std; const int N = 5000001; long long t[N+10]; int n, a, b; long long ABS(long long x) { if(x < 0) return -x; return x; } long long MAX(long long x, long long y) { if(x > y) return x; return y; } int main(void) { int T; scanf("%d", &T); int cnt = 1; // freopen("in.txt", "w", stdout); while(cnt <= T) { int i; scanf("%d%d%d", &n, &a, &b); long long ans; t[N] = -N; t[N+1] = N; int max1 = N, max2 = N;//第一大的数max1,第二大的数max2 int min1 = N+1, min2 = N+1;//第一小的数min1,第二小的min2 int min02 = N+1, min01 = N+1;//最接近0的数min01,第二接近0的数min02 for(i = 0; i < n; i++) { scanf("%I64d", &t[i]); if(t[max1] < t[i]) { max2 = max1; max1 = i; } else if(t[max2] < t[i]) { max2 = i; } if(t[min1] > t[i]) { min2 = min1; min1 = i; } else if(t[min2] > t[i]) { min2 = i; } if(ABS(t[min01]) > ABS(t[i])) { min02 = min01; min01 = i; } else if(ABS(t[min02]) > ABS(t[i])) { min02 = i; } } long long tmp; if(a > 0) { if(b > 0) { ans = a*t[max2]*t[max2] + b*t[max1]; tmp = a*t[max1]*t[max1] + b*t[max2]; if(ans < tmp) ans = tmp; tmp = a*t[min1]*t[min1] + b*t[max1]; if(ans < tmp) ans = tmp; } else if(b < 0) { ans = a*t[min2]*t[min2] + b*t[min1]; tmp = a*t[min1]*t[min1] + b*t[min2]; if(ans < tmp) ans = tmp; tmp = a*t[max1]*t[max1] + b*t[min1]; if(ans < tmp) ans = tmp; } else { ans = a*t[max1]*t[max1]; tmp = a*t[min1]*t[min1]; if(ans < tmp) ans = tmp; } } else if(a < 0) { if(b > 0) { if(min01 != max1) ans = a*t[min01]*t[min01] + b*t[max1]; else { ans = a*t[min02]*t[min02] + b*t[max1]; tmp = a*t[min01]*t[min01] + b*t[max2]; if(ans < tmp) ans = tmp; } } else if(b < 0) { if(min01 != min1) ans = a*t[min01]*t[min01] + b*t[min1]; else///min01=min1 { ans = a*t[min02]*t[min02] + b*t[min1]; tmp = a*t[min01]*t[min01] + b*t[min2]; if(ans < tmp) ans = tmp; } } else { ans = a*t[min01]*t[min01]; } } else///a=0 { if(b > 0) { ans = b*t[max1]*t[max1]; } else { ans = b*t[min1]*t[min1]; } } printf("Case #%d: %I64d\n", cnt++, ans); } return 0; }