hdu 4223 Dynamic Programming? (dp)

//连续的和的绝对值最小
# include 
  
   
# include 
   
     # include 
    
      # include 
     
       using namespace std; int main() { int t,i,j,num,n,min1; int sum[1010],a[1010]; int cas=0; while(~scanf("%d",&t)) { while(t--) { scanf("%d",&n); for(i=0; i
      






       =0; j--) { num=num+a[j]; if(sum[i]>abs(num)) sum[i]=abs(num); } if(min1>sum[i]) min1=sum[i]; } printf("Case %d: %d\n",++cas,min1); } } return 0; }