Cod sursa(job #1042448)
Utilizator | Data | 27 noiembrie 2013 00:51:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
long n,i,x,beginn,finall,s,sumax,beginnn;
f>>n>>x;
s=x;
sumax=x;
beginn=1;
for(i=2;i<=n;i++)
{
f>>x;
s=s+x;
if(s>sumax)
{
finall=i;
sumax=s;
beginnn=beginn;
}
if(s<=0)
{
s=0;
beginn=i+1;
}
}
g<<sumax<<" "<<beginnn<<" "<<finall;
}