Cod sursa(job #967060)

Utilizator dropsdrop source drops Data 26 iunie 2013 23:56:53
Problema Subsecventa de suma maxima Scor 95
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <queue>
#include <deque>
#include <list>
#include <ctime>
#include <string>
#include <algorithm>
using namespace std;
ifstream ff("ssm.in");
ofstream gg("ssm.out");

int n, p, u, p1, s, s1, x;

int main(){
	ff >> n;
	ff >> s;
	p=u=p1=1; s1=s;
	for(int i=2;i<=n;i++){
		ff >> x;
		if(s1+x<=x){ p1=i; s1=x; } else s1+=x;
		if(s1>s){ p=p1; u=i; s=s1; }
	}
	gg << s << " " << p << " " << u << "\n";
	return 0;
}