最大子段和【模板】

#define MAXN 1002
int num[MAXN];

int whMaxSub(int a[],int len) {

int tmp = INT_MIN;
int subMax = INT_MIN;
for (int i=0;i<len;++i) {

if(tmp<0)
tmp = a[i];
else
tmp = tmp+a[i];

subMax = max(tmp,subMax);
}

return subMax;
}