【[Offer收割]编程练习赛12 D】 寻找最大值

【题目链接】:http://hihocoder.com/problemset/problem/1496

【题意】

【题解】

先把这n个数排个序吧.
这样相邻的数字就在一起了;
这样a[i]&a[i+1]的值肯定是尽可能地大了;
然后乘上a[i]*a[i+1]再取max就好;
奇怪的贪心。
我是想不到反例啦。

【完整代码】

#include <bits/stdc++.h>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define mp make_pair
#define ps push_back
#define fi first
#define se second
#define rei(x) scanf("%d",&x)
#define rel(x) scanf("%lld",&x)
#define ref(x) scanf("%lf",&x)

typedef pair<int, int> pii;
typedef pair<LL, LL> pll;

const int dx[9] = { 0,1,-1,0,0,-1,-1,1,1 };
const int dy[9] = { 0,0,0,-1,1,-1,1,-1,1 };
const double pi = acos(-1.0);
const int N = 1e5+100;

int T;
LL a[N];

int main()
{
    //freopen("F:\\rush.txt", "r", stdin);
    rei(T);
    while (T--)
    {
        int n;
        rei(n);
        rep1(i, 1, n)
            rel(a[i]);
        sort(a + 1, a + 1 + n);
        LL ma = 0;
        rep1(i, 1, n - 1)
            ma = max(ma, a[i] * a[i + 1] * (a[i] & a[i + 1]));
        printf("%lld\n", ma);

    }
    //printf("\n%.2lf sec \n", (double)clock() / CLOCKS_PER_SEC);
    return 0;
}

转载于:https://www.cnblogs.com/AWCXV/p/7626491.html