dp——最大子段和

题目https://www.luogu.org/problemnew/show/P1115

#include <iostream>
using namespace std;
int a[10000];
int main() 
{ 
	int n = 0; 
	cin>>n; 
	int sum = 0, res = 0; 
	for(int i = 0; i<n; i++)
	{ 
  		int tmp;
  		cin>>tmp;a[i]=tmp; 
  		if(sum < 0)
  		{ 
  			sum = 0; 
		} 
  		sum += tmp; 
  		if(sum > res)
		{ 
  			res = sum; 
   		} 
    } 
    int max=-999999;
    if(res == 0)
    {
    	for(int i=0;i<n;i++)
    	{
    		if(a[i]>max)
    		{
    		max=a[i];	
			}
		}
	}
	else{
		max=res;
	}
	cout<<max<< endl;
	return 0; 
}