独步天下的博客

Problem DescriptionGiven 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

Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest

大数相减基本都是采用字符数组处理，需要注意的是够不够减、结果中高位的0。对于小数减大数，都是用大数减小数，结果在前面加一个“—”符号就行了。这里为方便点，假设是大数减小数。void BigNum(char *str1, char *str2){ if(str1 == NULL || str2 == NULL) return; int len1 = strlen(str1);