POJ - 2593(求两个不相交最大子段和)
从左向右扫,求得【1,i 】的最大子段和,1<=i<n从右向做扫,求得【 i,n】的最大子段和,1<i<=n然后 O(n) 枚举断点#include<cctype>#include<cstdio>#include<algorithm>#include<cstring>using namespace std;ty...