Kadane's algorithm

int Kadane(std::vector<int>& T)
{
    for (int i = 0, mx = 0, sum = 0; i < T.size(); i++)
    {
        sum += T[i];
        mx = max(mx, sum = max(sum, 0));
    }
    return mx;
}