最大连续子序列和(二)
之和
}
if (maxhere > maxsum) {
maxsum = maxhere; //更新最大连续子序列和
max_start = tmp;
max_end = a[i];
}
}
printf("%d %d %d\n", maxsum, max_start, max_end);
}
int main(){
#ifndef ONLINE_JUDGE
freopen("1011.in", "r", stdin);
freopen("1011.out", "w", stdout);
#endif
while(scanf("%d", &n)==1 && n!=0){
memset(buf, 0, sizeof(buf));
for(int i=0; i
scanf("%d", &buf[i]);
}
//maxsequence(n); www.2cto.com
//printf("%d\n", maxsequence2(buf, 0, n-1));
maxsequence3(buf, n);
}
}
#endif
对于解法2仍存在问题，待解决。解法一和三顺利AC