编程思路求解
是好几题 ，请指导 。不需要程序 ，只要个思路 就好1.两个 18位数的 数 相加，该怎么 写这个 函数？（目前的想法是用数组。但 貌似绕进一个湾里）
2.表述 不好。还是 个原题吧。。
Problem Description
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Input
The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).
Output
For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.
Sample Input
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5
Sample Output
Case 1:
14 1 4
Case 2:
7 1 6
3. 一只小白兔在一条开满玫瑰花的路上，寻找一朵最美的玫瑰，小白兔不能后退也没办法看到看到前面的花，她怎么 才能找到一朵最美的玫瑰。（只能 摘 一次的 ，）
[ 本帖最后由 yy2222 于 2010-12-12 22:50 编辑 ]
