Camel trading - UVa 10700 dp
来源:互联网 发布:阿里数据研究院 编辑:程序博客网 时间:2024/05/29 10:12
Camel trading
Time Limit: 1 second
Background
Aroud 800 A.D., El Mamum, Calif of Baghdad was presented the formula 1+2*3*4+5, which had its origin in the financial accounts of a camel transaction. The formula lacked parenthesis and was ambiguous. So, he decided to ask savants to provide him with a method to find which interpretation is the most advantageous for him, depending on whether is is buying or selling the camels.
The Problem
You are commissioned by El Mamum to write a program that determines the maximum and minimum possible interpretation of a parenthesis-less expression.
Input
The input consists of an integer N, followed by N lines, each containing an expression. Each expression is composed of at most 12 numbers, each ranging between 1 and 20, and separated by the sum and product operators+ and *.
Output
For each given expression, the output will echo a line with the corresponding maximal and minimal interpretations, following the format given in the sample output.
Sample input
31+2*3*4+54*18+14+7*103+11+4*1*13*12*8+3*3+8
Sample output
The maximum and minimum are 81 and 30.The maximum and minimum are 1560 and 156.The maximum and minimum are 339768 and 5023.
题意:通过添加括号改变运算顺序,求最后结果的最大值和最小值。
思路:简单的dp,dp[i][j]=max(dp[i][k] *+ dp[k+1][j])。注意最后结果用long long.
AC代码如下:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;typedef long long ll;int T,t,n;char s[100010],type[1010];ll dp[1010][1010],num[1010],maxn,minn,INF=1e18;void init(){ int i,j,k=0,len=strlen(s); n=0; for(i=0;i<=len;i++) { if(s[i]=='*' || s[i]=='+' || s[i]=='\0') { num[++n]=k; k=0; type[n]=s[i]; } else { k=k*10+s[i]-'0'; } }}int main(){ int i,j,k,p; scanf("%d",&T); for(t=1;t<=T;t++) { scanf("%s",s); init(); for(i=1;i<=n;i++) dp[i][i]=num[i]; for(p=1;p<=n;p++) for(i=1;i+p<=n;i++) { j=i+p; dp[i][j]=0; for(k=i;k<j;k++) { if(type[k]=='*') dp[i][j]=max(dp[i][j],dp[i][k]*dp[k+1][j]); else dp[i][j]=max(dp[i][j],dp[i][k]+dp[k+1][j]); } } maxn=dp[1][n]; for(p=1;p<=n;p++) for(i=1;i+p<=n;i++) { j=i+p; dp[i][j]=INF; for(k=i;k<j;k++) { if(type[k]=='*') dp[i][j]=min(dp[i][j],dp[i][k]*dp[k+1][j]); else dp[i][j]=min(dp[i][j],dp[i][k]+dp[k+1][j]); } } minn=dp[1][n]; printf("The maximum and minimum are %lld and %lld.\n",maxn,minn); }}
- Camel trading - UVa 10700 dp
- uva 10700 Camel trading
- UVa 10700 - Camel trading
- uva 10700 - Camel trading
- uva 10700 - Camel trading
- UVA 10700 Camel trading
- UVA 10700 - Camel trading
- UVa 10700 Camel trading
- uva 10700 Camel trading
- uva 10700 Camel trading
- uva 10700 Camel trading
- uva 10700 - Camel trading
- UVa 10700 - Camel trading
- UVA - 10700 Camel trading
- UVA - 10700 Camel trading
- UVa 10700 - Camel trading
- UVA 10700 Camel trading
- UVA 10700 Camel trading(贪心)
- Linux下 JAVA环境 Tomcat+JDK
- Struts2配置错误之The Struts dispatcher cannot be found
- const的用法
- 在数字间填入加号或者减号,使等式成立
- 指纹识别调试记录
- Camel trading - UVa 10700 dp
- R语言学习笔记 .
- onAttachedToWindow()在整个Activity生命周期的位置及使用
- Android中使用addr2line来分析native信息
- Billboard(线段树)
- android代码解析之图片缓存(ImageDownloader)
- UVa 1617 - Laptop(贪心)
- Objective-C 常量的设置
- 获取原生mapreduce程序、sqoop、hive提交的jobId