Largest Point（想法题+贪心思想）

Link：http://acm.hdu.edu.cn/showproblem.php?pid=5461

Largest Point

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

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

  
  

   
   2

3 2 1
1 2 3

5 -1 0
-3 -3 0 3 3
  
  

 

Sample Output

  
  

   
   Case #1: 20
Case #2: 0
  
  

 

Source

2015 ACM/ICPC Asia Regional Shenyang Online

 

AC code：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#include<map>
#include<stack>
#include<vector>
#define LL long long
#define MAXN 1000010
using namespace std;

struct node{
	int id;
	LL v;
}aa[MAXN],bb[MAXN];
LL t[5*MAXN];
bool cmp(node a,node b)
{
	return a.v>b.v;
}
LL ans;
int main()
{
	int T,n,a,b,i,cas;
	scanf("%d",&T);
	cas=0;
	while(T--)
	{
		cas++;
		scanf("%d%d%d",&n,&a,&b);
		for(i=1;i<=n;i++)
		{
			scanf("%I64d",&t[i]);
			aa[i].v=a*t[i]*t[i];
			bb[i].v=b*t[i];
			aa[i].id=i;
			bb[i].id=i;
		}
		sort(aa+1,aa+n+1,cmp);
		sort(bb+1,bb+n+1,cmp);
		if(aa[1].id!=bb[1].id)
		{
			ans=aa[1].v+bb[1].v;
		}
		else
		{
			LL ans1=aa[1].v+bb[2].v;
			LL ans2=aa[2].v+bb[1].v;
			ans=max(ans1,ans2);
		}
		printf("Case #%d: %I64d\n",cas,ans);
	 } 
  	return 0;
}