Cod sursa(job #1295798)
Utilizator | Data | 20 decembrie 2014 10:58:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int main()
{
ifstream si;
si.open("ssm.in");
ofstream so;
so.open("ssm.out");
int n;
si>>n;
int maxx=0,in,f,i,a,s=0,x=0;
for(i=0;i<n;++i)
{
si>>a;
s+=a;
if(s<0)
{
s=0;
x=i+1;
}
else
if(s>maxx)
{
in=x;
f=i;
maxx=s;
}
}
so<<maxx<<' '<<in+1<<' '<<f+1;
}