Cod sursa(job #1893572)

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

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;
}

Subset subset_sum(int n, 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 < n; 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");
    int n, x;
    int *v;

    f >> n;
    v = (int*) calloc(n, sizeof(int));
    for (unsigned int i = 0; i < n; i++) {
        f >> x;
        v[i] = x;
    }

    g << subset_sum(n, v);
    g << endl;

    return 0;
}