Growling Gears （计蒜客）

The Best Acceleration Production Company specializes in multi-gear engines. The performance of an engine in a certain gear, measured in the amount of torque produced, is not constant: the amount of torque depends on the RPM of the engine. This relationship can be described using a torque-RPM curve.

For the latest line of engines, the torque-RPM curve of all gears in the engine is a parabola of the form T = -aR^2 +bR+cT=−aR2+bR+c,where RR is the RPM of the engine,and TT is the resulting torque.

Given the parabolas describing all gears in an engine, determine the gear in which the highest torque is produced. The first gear is gear 11, the second gear is gear 22, etc. There will be only one gear that produces the highest torque: all test cases are such that the maximum torque is at least 11 higher than the maximum torque in all the other gears.

Input Format

On the first line one positive number: the number of test cases, at most 100100. After that per test case:

• one line with a single integer nn (1 \le n \le 10)(1≤n≤10): the number of gears in the engine.
• nn lines, each with three space-separated integers aa, bb and cc (1 \le a, b, c \le 10^4)(1≤a,b,c≤104): the parameters of the parabola T = -aR^2 +bR+cT=−aR2+bR+c describing the torque-RPM curve of each engine.

Output Format

Per test case:

• one line with a single integer: the gear in which the maximum torque is generated.

样例输入

3
1
1 4 2
2
3 126 1400
2 152 208
2
3 127 1400
2 154 208

样例输出

1
2
2

题意：有一条抛物线其方程为, 然后每次给你n条抛物线的a,b,c值，求给的n条抛物线中y轴的最大值是那条抛物线的。

解法：依次求出每条抛物线的最大值 （配方），再根据其进行排序即可。

#include <iostream>
#include <algorithm>
using namespace std;
typedef struct{
    double value;
    int num;
}P;
bool cmp(P q, P w) {
    return q.value > w.value;//定义排序方式
}
int main() {
    int t, n, a, b, c;
  	cin>>t;
    while(t--) {
        P p[20];
        cin>>n;
        for(int i = 0; i < n; i++) {
            cin>>a>>b>>c;
            p[i].num = i + 1;
            p[i].value = 1.0*b*b/(4*a) + c;
        }
        sort(p, p + n, cmp);
        cout<<p[0].num<<endl;
    }
    return 0;
}