uva 12709 2013Dhaka A

a,b,c在c最大的情况下选a*b*c最大的

代码如下：

/**************************************************
 * Author     : xiaohao Z
 * Blog     : http://www.cnblogs.com/shu-xiaohao/
 * Last modified : 2014-07-05 21:29
 * Filename     : uva_12709.cpp
 * Description     : 
 * ************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#define MP(a, b) make_pair(a, b)
#define PB(a) push_back(a)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned int,unsigned int> puu;
typedef pair<int, double> pid;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;

const int INF = 0x3f3f3f3f;
const double eps = 1E-6;
const int LEN = 10100;

struct P{
    int a, b, c;
}p[LEN];

int main()
{
//    freopen("in.txt", "r", stdin);

    int n;
    while(cin >> n && n){
        int val = 0;
        for(int i=0; i<n; i++){
            cin >> p[i].a >> p[i].b >> p[i].c;
            val = max(val, p[i].c);
        }
        int ans = 0;
        for(int i=0; i<n; i++){
            if(val == p[i].c){
                ans = max(ans, p[i].a*p[i].b*p[i].c);
            }
        }
        cout << ans << endl;
    }
    return 0;
}