求最大字符串，比如－2 1 4 －3 2那么结果应该是 1 4

本文链接：https://blog.csdn.net/dengdaiforever/article/details/8019919

/*#include <iostream>
using namespace std;
int main()
{
   int a[5];
   int sum=0;
   int st=0;
   int en=4;
   int k;
   int temp=sum;
   for(int i=0;i<5;i++)
   {
       cin>>a[i];
   }
   for (i=0;i<5;i++)
   {
       k=0;
       while(k<5-i)
       {
           for (int j=i;j<k+1;j++)
           {
               sum+=a[j];
           }
           if(sum>temp)
           {
               temp=sum;
               st=i;
               en=i+k;
           }
           k++;
           sum=0;

       }
   }
   for(i=st;i<=en;i++)
       cout<<a[i]<<" ";
   return 0;
}*/
#include <iostream>
#include <vector>
using namespace std;
int main()
{
   vector<int>vec;
   int x;
   int n;
   int sum=0;
   int st=0;
   int k
   cout<<"please input number:"<<endl;
   cin>>n;
   int n1=n;
   cout<<"please input para :"<<endl;
   while(n1!=0)
   {
       cin>>x;
       vec.push_back(x);
       n1--;
   }
   //for(vector<int>::iterator it=vec.begin())
   for(k=st;k<n;k++)
   {
       sum+=vec[k];
       if(sum<0)
       {
           st=k+1;
           sum=0;
       }
   }
   cout<<sum;
}