BNUOJ 36005 Chemical Reaction

Chemical Reaction

Time Limit: 3000ms

Memory Limit: 65536KB

This problem will be judged on OpenJudge. Original ID: C14H
64-bit integer IO format: %lld Java class name: Main

There are n chemical elements. Each of them has two attributes, a and b. When two different elements are mixed, a chemical reaction will occur. During a chemical reaction, energy will be released. The following expression tells the amount of energy that is released when i-th element and j-th element are mixed:

|ai - aj| ∙ bi ∙ bj / max(|bi|, |bj|)

Could you find the maximal energy that can be released by mixing two elements?

Note that the value of the expression may be negative, which means the chemical reaction absorbs energy. For simplicity, we regard it as releasing negative energy, so you can compare two values of the expression directly to determine which releases more energy.

Input

The first line contains an integer T (1 ≤ T ≤ 10) -- the number of test cases.

For each test case:
The first line contains an integer n. 2 ≤ n ≤ 500 000.
Then follows n lines, each line contains two integers: a, b, indicate the two attributes of a chemical element. 0 ≤ | a | ≤ 10 000. 1 < | b | ≤ 10 000.

Output

For each test case, output one integer in a single line -- the maximal energy that can be released by mixing two elements.

Sample Input

Sample Output

22

解题：把b进行分类，负数的一边，正数的一边，然后就可以了。。。。

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cmath>

 #include <algorithm>

 #include <climits>

 #include <vector>

 #include <queue>

 #include <cstdlib>

 #include <string>

 #include <set>

 #include <stack>

 #define LL long long

 #define INF 0x3f3f3f3f

 #define pii pair<int,int>

 using namespace std;

 const int maxn = ;

 struct node {

     int x,y,id,minv,maxv;

     node(int tx = ,int ty = ,int tz = ) {

         x = tx;

         y = ty;

         id = tz;

     }

   bool operator< (const node &t)const{

         return y < t.y;

     }

 };

 node pa[maxn],pb[maxn];

 int ca,cb,u[maxn],v[maxn],T,n;

 int bsearch(int lt,int rt,int val,node *d){

     int ans = rt+;

     while(lt <= rt){

         int mid = (lt+rt)>>;

         if(d[mid].y >= val){

             ans = mid;

             rt = mid-;

         }else lt = mid+;

     }

     return ans;

 }

 int main() {

     scanf("%d",&T);

     while(T--) {

         scanf("%d",&n);

         for(int i = ca = cb = ; i < n; ++i) {

             scanf("%d %d",u+i,v+i);

             if(v[i] < ) pa[ca++] = node(u[i],-v[i],i);

             else pb[cb++] = node(u[i],v[i],i);

         }

         sort(pa,pa+ca);

         sort(pb,pb+cb);

         if(ca) pa[ca-].minv = pa[ca-].maxv = pa[ca-].x;

         if(cb) pb[cb-].minv = pb[cb-].maxv = pb[cb-].x;

         for(int i = ca-; i >= ; --i) {

             pa[i].minv = min(pa[i].x,pa[i+].minv);

             pa[i].maxv = max(pa[i].x,pa[i+].maxv);

         }

         for(int i = cb-; i >= ; --i) {

             pb[i].minv = min(pb[i].x,pb[i+].minv);

             pb[i].maxv = max(pb[i].x,pb[i+].maxv);

         }

         int ans = -INF;

         for(int i = ; i < n; ++i) {

             int idx = INF;

             if(ca) {

                 idx = bsearch(,ca-,abs(v[i]),pa);

                 if(idx < ca && pa[idx].id == i) idx++;

                 if(idx < ca) {

                     ans = max(ans,-abs(u[i] - pa[idx].minv)*v[i]);

                     ans = max(ans,-abs(u[i] - pa[idx].maxv)*v[i]);

                     ans = max(ans,-abs(pa[idx].minv - u[i])*v[i]);

                     ans = max(ans,-abs(pa[idx].maxv - u[i])*v[i]);

                 }

             }

             if(cb) {

                 idx = bsearch(,cb-,abs(v[i]),pb);

                 if(idx < cb && pb[idx].id == i) idx++;

                 if(idx < cb) {

                     ans = max(ans,abs(u[i] - pb[idx].minv)*v[i]);

                     ans = max(ans,abs(u[i] - pb[idx].maxv)*v[i]);

                     ans = max(ans,abs(pb[idx].minv - u[i])*v[i]);

                     ans = max(ans,abs(pb[idx].maxv - u[i])*v[i]);

                 }

             }

         }

         printf("%d\n",ans);

     }

     return ;

 }