Cod sursa(job #294949)

Utilizator hadesgamesTache Alexandru hadesgames Data 2 aprilie 2009 21:01:38
Problema Subsecventa de suma maxima Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
FILE *in,*out;
int a[6000005];
int main()
{
	int n,i,maxv,minv,pmin,start,stop,x;
	in=fopen("ssm.in","r");
	out=fopen("ssm.out","w");
	fscanf(in,"%d",&n);
	maxv=-(1<<30);
	minv=0;
	pmin=0;
	FOR(i,1,n)
	{
		fscanf(in,"%d",&x);
		a[i]=x+a[i-1];
		if (maxv<a[i]-minv)
		{
			maxv=a[i]-minv;
			start=pmin+1;
			stop=i;
		}
		if (minv>a[i])
		{
			minv=a[i];
			pmin=i;
		}
	}
	fprintf(out,"%d %d %d\n",maxv,start,stop);
	fclose(in);
	fclose(out);
	return 0;
}