最大子串和--动态规划经典问题

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>

using namespace std;

int n, p[10010];

int main()
{
	while (cin >> n)
	{
		for (int i = 0; i < n; i++)
			cin >> p[i];
		int b = 0, sum = 0;

		for (int i = 0; i < n; i++)
		{
			b += p[i];
			if (b > sum)
				sum = b;
			if (b < 0)
				b = 0;
		}
		cout << sum << endl;
	}
	return 0;
}