uva 11059 Maximum Product
2017-08-07 21:54
387 查看
题目解析:
题目的意思十分简单,首先输入一个数n,紧接着下面输入n个数,求子串的最大乘积,如果最大乘积小于0,直接输出0;
题目解析:
这是一个简单的模拟题,十分的水就不多说了
代码;
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=20;
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n,a[maxn];
long long ans[maxn][maxn];
int cas=0;
while(cin>>n&&n) {
cas++;
for(int i=1; i<=n; i++)
cin>>a[i];
for(int i=0; i<=n; i++)
for(int j=1; j<=n; j++)
ans[i][j]=1;
long long max_a=-10000000000;
for(int i=1; i<=n; i++)
for(int j=i; j<=n; j++)
for(int k=i; k<=j; k++) {
ans[i][j]*=a[k];
if(max_a<ans[i][j])
max_a=ans[i][j];
}
// for(int i=1; i<=n; i++)
// for(int j=1; j<=n; j++)
if(max_a>0)cout<<"Case #"<<cas<<": The maximum product is "<<max_a<<"."<<endl;
else cout<<"Case #"<<cas<<": The maximum product is "<<"0"<<"."<<endl;
cout<<endl;
}
return 0;
}
题目的意思十分简单,首先输入一个数n,紧接着下面输入n个数,求子串的最大乘积,如果最大乘积小于0,直接输出0;
题目解析:
这是一个简单的模拟题,十分的水就不多说了
代码;
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=20;
int main() {
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n,a[maxn];
long long ans[maxn][maxn];
int cas=0;
while(cin>>n&&n) {
cas++;
for(int i=1; i<=n; i++)
cin>>a[i];
for(int i=0; i<=n; i++)
for(int j=1; j<=n; j++)
ans[i][j]=1;
long long max_a=-10000000000;
for(int i=1; i<=n; i++)
for(int j=i; j<=n; j++)
for(int k=i; k<=j; k++) {
ans[i][j]*=a[k];
if(max_a<ans[i][j])
max_a=ans[i][j];
}
// for(int i=1; i<=n; i++)
// for(int j=1; j<=n; j++)
if(max_a>0)cout<<"Case #"<<cas<<": The maximum product is "<<max_a<<"."<<endl;
else cout<<"Case #"<<cas<<": The maximum product is "<<"0"<<"."<<endl;
cout<<endl;
}
return 0;
}
相关文章推荐
- UVA 11059 Maximum Product (暴力)
- UVa 11059 Maximum Product
- UVA-11059 Maximum Product
- UVa11059 Maximum Product
- UVA - 11059 Maximum Product
- Uva oj 11059 Maximum Product(简单枚举)
- Uva - 11059 - Maximum Product
- uva 11059 Maximum Product
- UVa 11059 Maximum Product
- uva 11059 Maximum Product
- Uva - 11059 - Maximum Product
- UVa - 11059 - Maximum Product(枚举)
- UVa 11059----Maximum Product(最长上升子序列乘积)
- UVA 11059 Maximum Product
- UVa 11059 - Maximum Product
- UVa - 11059 Maximum Product ( 枚举区间长度 )
- (暴力枚举) UVa 11059 Maximum Product
- UVa 11059 - Maximum Product
- UVA 11059 Maximum Product 最大乘积