Cod sursa(job #1893559)

Utilizator iordachevIordache Vlad iordachev Data 25 februarie 2017 19:32:09
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.34 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

class Subset
{
	public:
		int sum, start, stop;		
};

std::ostream& operator<<(std::ostream& stream, Subset s)
{
	stream << s.sum << " " << s.start << " " << s.stop;

   	return stream;
}

template <class T>
std::ostream& operator<<(std::ostream& stream, std::vector<T> vector)
{
    for (unsigned int i = 0; i < vector.size(); i++) {
        stream << vector[i] << " ";
    }
    return stream;
}

template <class T>
std::istream& operator>>(std::istream& stream, std::vector<T>& vector)
{
    unsigned int n;
    stream >> n;
    for (unsigned int i = 0; i < n; i++) {
        T x;
        stream >> x;
        vector.push_back(x);
    }
    return stream;
}

Subset subset_sum(vector<int> &v)
{
	Subset s;
	s.start = 0;
	s.stop = 0;
	s.sum = 0;

	int sum = 0, max_sum = 0;

	for(unsigned int i = 0; i < v.size(); i++)
	{
		if(sum < 0)
		{
			sum = 0;
			s.start = i;
		}
		// sum = (sum + abs(sum)) / 2;

		sum += v[i];

		if(sum > max_sum)
		{
			max_sum = sum;
			s.stop = i;
		}
	}

	s.sum = max_sum;

	return s;
}

int main()
{
	ifstream f("ssm.in");
    ofstream g("ssm.out");
    vector<int> v;
    int n, x;

    f >> v;

    // f >> n;
    // for (unsigned int i = 0; i < n; i++) {
    //     f >> x;
    //     vector.push_back(x);
    // }

    g << subset_sum(v);

    return 0;
}