hdu 4223 Dynamic Programming?

题目分析：求连续子序列绝对值的最小值，数据范围不大，模拟过的

#include<iostream>#include<cstdio>#include<math.h>using namespace std;int a[1010];int main(){int t,n;scanf("%d",&t);for(int k=1;k<=t;k++){int ans=100000;scanf("%d",&n);for(int i=0;i<n;i++)    scanf("%d",&a[i]);for(int i=0;i<n;i++){            int sum=0;for(int j=i;j<n;j++){sum+=a[j];if(abs(sum)<ans)ans=abs(sum);}}printf("Case %d: %d\n",k,ans);}system("pause");return 0;}