c_cpp 最大乘积子阵列

Posted 2021-05-14

#include <bits/stdc++.h>
using namespace std;
int maxProduct(int* arr, int n) 
{ 
	 int minVal = arr[0]; 
     int maxVal = arr[0];
     int maxProduct = arr[0]; 
     for (int i = 1; i < n; i++) { 
     	if (arr[i] < 0) 
            swap(maxVal, minVal); 
        maxVal = max(arr[i], maxVal * arr[i]); 
        minVal = min(arr[i], minVal * arr[i]); 
        
        maxProduct = max(maxProduct, maxVal); 
     }
     return maxProduct;
}
int main() {
   int arr[] = { -1, -3, -10, 0, 60 }; 
  
    int n = sizeof(arr) / sizeof(arr[0]); 
  
    cout << "Maximum Subarray product is "
         << maxProduct(arr, n) << endl; 
  
    return 0; 

	return 0;
}