首先,我觉得HDU越来越棒了。#include <stdio.h> int main() { int iCase; scanf("%d",&iCase); for(int cas = 1; cas <= iCase; cas++) { int sum,n,t,i,j,a,b,max; max = -9999; scanf("%d",&k); sum = 0; for(i=j=1 ; i <= n ; i++) { scanf("%d",&t); sum += t; if(max < sum) { max = sum; a = j; b = i; } if( sum < 0 ) { sum = 0; j = i+1; } } printf("Case %d:/n",cas); printf("%d %d %d/n",max,a,b); if(cas != iCase )printf("/n"); } return 0; } 这是一道DP题目。虽然不能通过此题领会DP. 我都怀疑算法中有没有DP的想法,还是这就是DP?