Largest sum sequence

lss.cpp

#include <vector>
#include <iostream>
using namespace std;
void main(){
    int x[] = { 1, -4 ,4 ,3 , -2 ,-3, 2 ,1 };
    vector<int> s(begin(x), end(x));

    int max_so_far = 0, begin_so_far =0, max = 0, begin = 0, end =0;
    int temp;
    for(int i = 0; i < s.size(); ++i){
        max_so_far += s[i];

        if( max_so_far < 0 ){
            begin_so_far = i+1;
            max_so_far = 0;
        }
        else{
            if( max_so_far >= max ){
                max = max_so_far;
                begin = begin_so_far;
                end = i;
            }
        }
    }

    cout << max << endl;
    cout << begin << " " << end <<  endl;
    cin.get();
}