View Code of Problem 19

#include <bits/stdc++.h>
using namespace std;

int main(void)
{
   vector <int> dp,num;
    int n,i,j,sum;
  while(cin>>n)
  {
    if(n==0)
      break;
	dp.resize(n,-10000);
    num.resize(n,0);
    for(i=0;i<n;++i)
      cin>>num[i];
    dp[0]=num[0];
    for(i=1;i<n;++i)
    {sum=0;
      for(j=i;j>=0;--j)
      {
        sum+=num[j];
        dp[i]=max(dp[i],sum);
      }
     dp[i]=max(dp[i],dp[i-1]);
    }
    cout<<dp[n-1]<<endl;
  }
}