题意:给出一个序列,求出乘积最大的子序列
解法:直接枚举起点和终点即可,N只有[1,18],| a[i] | <= 10,用long long 可以存下。
#include <bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define INF 0x3f3f3f3f
#define eps 1e-6
typedef long long LL;
const double pi = acos(-1.0);
const long long mod = 1e9 + 2015;
using namespace std;
LL a[20];
int main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
//freopen("int.txt","r",stdin);
//freopen("out.txt","w",stdout);
int N;
int first = 1;
while(cin >> N)
{
for(int i = 0;i < N;i++)
cin >> a[i];
LL ans = a[0];
for(int i = 0;i < N;i++)
for(int j = i;j < N;j++)
{
LL s = 1;
for(int k = i;k <= j;k++)
s *= a[k];
ans = max(s,ans);
}
if(ans < 0)
ans = 0;
printf("Case #%d: The maximum product is %lld.\n\n",first++,ans);
}
return 0;
}