Codeforces Round #670 (Div. 2) B. Maximum Product

http://codeforces.com/contest/1406/problem/B
无脑分类讨论就行
注意0

#include<iostream>
#include<string>
#include<math.h>
#include<algorithm>
#include<vector>
//#include<bits/stdc++.h>
typedef long long ll;
ll gcd(ll a, ll b)
{
 return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
 return a * b / (gcd(a, b));
}
#define PII pair<int,int>
using namespace std;
const int N = 2e6 + 10, mod = 1e9 + 7;
int qmi(int a, int k, int p)  //快速幂模板
{
 int res = 1;
 while (k)
 {
  if (k & 1) res = (ll)res * a % p;
  k >>= 1;
  a = (ll)a * a % p;
 }
 return res;
}
///
ll a[1000005];
int b[1000005];
int main()
{
 int t;
 cin >> t;
 while (t--) {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++)
   cin >> a[i];
  sort(a + 1, a + 1 + n);
  if (n == 5) {
   ll ans = 1;
   ans = a[1] * a[2] * a[3] * a[4] * a[5];
   cout << ans << endl;
  }
  else {
        int sign1 = 0;
  int sign2 = 0;
  int sign3 = 0;
  for (int i = 1; i <= n; i++) {
   if (a[i] < 0)
    sign1++;
   else if (a[i] > 0)
    sign2++;
   else if (a[i] == 0)
    sign3++;
  }
  if (sign3 == 0) {
   if (sign1 == 0) {
    ll ans = 1;
    ans = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
    cout << ans << endl;
   }
   else if (sign1 == 1) {
    ll ans = 1;
    ans = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
    cout << ans << endl;
   }
   else if (sign1 == 2) {
    ll ans1 = 1, ans2 = 1;
    ans1 = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
    ans2 = a[1] * a[2] * a[n] * a[n - 1] * a[n - 2];
    cout << max(ans1, ans2) << endl;
   }
   else if (sign1 == 3) {
    ll ans1 = 1, ans2 = 1;
    ans1 = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
    ans2 = a[1] * a[2] * a[n] * a[n - 1] * a[n - 2];
    cout << max(ans1, ans2) << endl;
   }
   else if (sign1 == 4) {
    ll ans1 = 1; ll ans2 = 1; ll ans3 = 1;
    ans1 = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
    ans2 = a[1] * a[2] * a[n] * a[n - 1] * a[n - 2];
    ans3 = a[1] * a[2] * a[3] * a[4] * a[n];
    cout << max(ans1, max(ans2, ans3)) << endl;
   }
   else if (sign1 >= 5) {
    ll ans1 = 1; ll ans2 = 1; ll ans3 = 1;
    ans1 = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
    ans2 = a[1] * a[2] * a[n] * a[n - 1] * a[n - 2];
    ans3 = a[1] * a[2] * a[3] * a[4] * a[n];
    cout << max(ans1, max(ans2, ans3)) << endl;
   }
  }
  else {
   if (n - sign3 < 5)
    cout << 0 << endl;
   else {
    if (sign1 == 0) {
     ll ans = 1;
     ans = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
     cout << ans << endl;
    }
    else if (sign1 == 1) {
     ll ans = 1;
     ans = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
     cout << ans << endl;
    }
    else if (sign1 == 2) {
     ll ans1 = 1, ans2 = 1;
     ans1 = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
     ans2 = a[1] * a[2] * a[n] * a[n - 1] * a[n - 2];
     cout << max(ans1, ans2) << endl;
    }
    else if (sign1 == 3) {
     ll ans1 = 1, ans2 = 1;
     ans1 = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
     ans2 = a[1] * a[2] * a[n] * a[n - 1] * a[n - 2];
     cout << max(ans1, ans2) << endl;
    }
    else if (sign1 == 4) {
     ll ans1 = 1; ll ans2 = 1; ll ans3 = 1;
     ans1 = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
     ans2 = a[1] * a[2] * a[n] * a[n - 1] * a[n - 2];
     ans3 = a[1] * a[2] * a[3] * a[4] * a[n];
     cout << max(ans1, max(ans2, ans3)) << endl;
    }
    else if (sign1 >= 5) {
     ll ans1 = 1; ll ans2 = 1; ll ans3 = 1;
     ans1 = a[n] * a[n - 1] * a[n - 2] * a[n - 3] * a[n - 4];
     ans2 = a[1] * a[2] * a[n] * a[n - 1] * a[n - 2];
     ans3 = a[1] * a[2] * a[3] * a[4] * a[n];
     cout << max(ans1, max(ans2, ans3)) << endl;
    }
   }
  }
  }
  
 }
 return 0;
}
```cpp
注意开longlong，没开longlong让我一直wa