#include<iostream>
#include<vector>
using namespace std;
#define MAX 10000
inline long long max(long long a,long long b){return a>b?a:b;}
inline long long min(long long a,long long b){return a>b?b:a;}
int main()
{
vector<int> data;
int number,n;
long long pMax[3][MAX]={0};
long long pMin[3][MAX]={0};
cin >> n;
for(int i=0;i<n;i++)
{
cin>>number;
data.push_back(number);
}
int size = data.size();
for(int i=0;i<3;i++)
{
for(int j=0;j<size;j++)
{
if(i==0)
pMax[i][j]=pMin[i][j]=data[j];
else
{
for(int k=j-1;k>=0;k--)
{
pMax[i][j]&#
给定一个无序数组,包含正数、负数和0,要求从中找出3个数的乘积,使得乘积最大,要求时间复杂度:O(n),空间复杂度:O(1)动态规划算法#include<iostream>#include<vector>using namespace std;#define MAX 10000inline long long max(long long a,long lo...