摘要：Problem 给定一个长度为n的数字串,从中选取k个不重叠的子串（可以少选）,将每个串求和si 求max|s1 s2| + |s2 s3| + ... + |sk 1 sk|(n include include include include using namespace std; define 阅读全文