1007. Maximum Subsequence Sum (25)

#include<iostream>#include<vector>using namespace std;int M,B,E;vector<int> vec;int main(){    M=-1;    int N;    cin>>N;    int v;    for(int t=0;t<N;t++)    {        cin>>v;        vec.push_back(v);    }    B=vec[0];    E=vec[N-1];    int sum;    for(int i=0;i<N;i++)    {        sum=0;        for(int j=i;j<N;j++)        {            sum+=vec[j];            if(sum>M)            {                M=sum;                B=vec[i];                E=vec[j];            }        }    }    if(M==-1)M=0;    cout<<M<<" "<<B<<" "<<E<<endl;}