uav 11258 String Partition (DP)
来源:互联网 发布:仿苹果软件 编辑:程序博客网 时间:2024/05/16 05:59
John was absurdly busy for preparing a programming contest recently. He wanted to create a ridiculously easy problem for the contest. His problem was not only easy, but also boring: Given a list of non-negative integers, what is the sum of them?
However, he made a very typical mistake when he wrote a program to generate the input data for his problem. He forgot to print out spaces to separate the list of integers. John quickly realized his mistake after looking at the generated input file because each line is simply a string of digits instead of a list of integers.
He then got a better idea to make his problem a little more interesting: There are many ways to split a string of digits into a list of non-zero-leading (0 itself is allowed) 32-bit signed integers. What is the maximum sum of the resultant integers if the string is split appropriately?
Input
The input begins with an integer N (≤ 500) which indicates the number of test cases followed. Each of the following test cases consists of a string of at most 200 digits.
Output
For each input, print out required answer in a single line.
Sample input
6
1234554321
5432112345
000
121212121212
2147483648
11111111111111111111111111111111111111111111111111111
1234554321
5432112345
000
121212121212
2147483648
11111111111111111111111111111111111111111111111111111
Sample output
1234554321
543211239
0
2121212124
214748372
5555555666
543211239
0
2121212124
214748372
5555555666
题意:给定一个字符串序列,让你把它划分成几个int型的数字,并且使这些数字之和最大。
思路:dp[i]表示前i个字符划分时的和的最大值。
dp[i] = max(dp[i], dp[i-j]+num),num为从后往前划分为j长度的数字。
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <climits>#define LL long longusing namespace std;const LL inf=INT_MAX;const int maxn=210;LL dp[maxn];string str;void initial(){ memset(dp,0,sizeof(dp));}void input(){ cin>>str;}int get_num(char ch){ return ch-'0';}void solve(){ int len=str.size(); dp[1]=get_num(str[0]); for(int i=2;i<=len;i++) { LL tmp=1,now=0; for(int k=i-1,j=1;k>=0;k--,j++) { now=get_num(str[k])*tmp+now; if(now>inf) break; dp[i]=max(dp[i],dp[i-j]+now); tmp*=10; } } printf("%lld\n",dp[len]);}int main(){ int T; scanf("%d",&T); while(T--) { initial(); input(); solve(); } return 0;}
0 0
- uav 11258 String Partition (DP)
- UVA 11258 String Partition(dp)
- uva 11258 - String Partition(dp)
- uva 11258 String Partition(DP)
- String Partition - UVa 11258 dp
- UVa 11258 String Partition(DP)
- UVA 11258 String Partition(线性DP)
- uva 11258 String Partition (DP)
- UVa 11258 - String Partition(dp)
- UVA 题目11258 - String Partition(DP)
- uva_11258 - String Partition( 区间DP )
- uva 11258 String Partition
- 11258 - String Partition
- UVA 11258 String Partition
- uva 11258 String Partition
- uva 11258 String Partition
- UVa 11258 - String Partition
- UVA - 11258 String Partition
- 如何禁用Windows错误报告
- qt 之 macro
- hashcode的简单简析
- 80端口被NT kernel & System 占用pid 4
- 中文字体font-family常用列表
- uav 11258 String Partition (DP)
- VC6.0建立控制台程序实现PDA应用
- 网络工程1101班2014-2015学年《网络软件开发实训》期末考试
- 【ORA-02049】超时分布式事务处理等待锁
- 21天学通JavaScript读书笔记 (二)数组
- Django和js中的传參方法
- POJ1001高精度小数运算
- 使用jquery.twbsPagination分页时遇到的问题
- VM 无法使用解决办法