View Code of Problem 19

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

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