c_cpp 找到一个整数数组中包含最大乘积的对

Posted 2021-05-14

// https://www.geeksforgeeks.org/return-a-pair-with-maximum-product-in-array-of-integers/
#include <iostream>
using namespace std;

int main(){
    int n;
    cin>>n;
    int a[n];
    for (int i=0;i<n;i++)
        cin>>a[i];

    int min1=INT_MAX, min2=INT_MAX, max1=INT_MIN, max2=INT_MIN;

    for (int i=0;i<n;i++){
        if (a[i] > max1){
            max2=max1;
            max1=a[i];
        }
        else if (a[i] > max2 && a[i] < max1){
            max2=a[i];
        }
        if (a[i] < min1){
            min2=min1;
            min1=a[i];
        }
        else if (a[i] > min1 && a[i] < min2){
            min2=a[i];
        }
    }
    if (min1*min2 < max1*max2)
        cout << "Max product is: " << max1*max2 << ", {"<<max2 << ", " << max1 << "}";
    else
        cout << "Max product is: " << min1*min2 << ", {"<<min1 << ", " << min2 << "}";
}