Dynamic Programming?

题目：
Dynamic Programming, short for DP, is the favorite of iSea. It is a method for solving complex problems by breaking them down into simpler sub-problems. It is applicable to problems exhibiting the properties of overlapping sub-problems which are only slightly smaller and optimal substructure.
Ok, here is the problem. Given an array with N integers, find a continuous subsequence whose sum’s absolute value is the smallest. Very typical DP problem, right?
Input
The first line contains a single integer T, indicating the number of test cases.
Each test case includes an integer N. Then a line with N integers Ai follows.

Technical Specification

1. 1 <= T <= 100
2. 1 <= N <= 1 000
3. -100 000 <= Ai <= 100 000
   Output
   For each test case, output the case number first, then the smallest absolute value of sum.
   Sample Input
   2
   2
   1 -1
   4
   1 2 1 -2
   Sample Output
   Case 1: 0
   Case 2: 1

题目描述：输出一个序列的最小绝对值最小的相邻的子序列。

解题思路：可以直接暴力，
也可以用dp思想来做用dp的话，就是以第i个数结束的时候的最小值，记得在第二重循环更新记录下最小值，最后再遍历，求所有最小值的最小值

这里我是用暴力做的

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
 
int main()
{
	int t;
	cin>>t;
	for(int k=1;k<=t;k++)
	{
		int n,min;
		int aa[10105];
		cin>>n;
		for(int i=0;i<n;i++)
		   cin>>aa[i];
		min=abs(aa[0]);
		for(int i=0;i<n;i++)
		{
			int sum=0; 
			for(int j=i;j<n;j++)
			{
				sum+=aa[j];
				if(abs(sum)<min)min=abs(sum);
			}
		}
cout<<"Case"<<' '<<k<<": "<<min<<endl;
	}
	return 0;
}