Cod sursa(job #681485)
Utilizator | Alex Ovidiu Nitu alex_ovidiunitu | Data | 17 februarie 2012 10:31:21 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int best=-5156456, sum ,a,inc=1,sf;
int main(void)
{
fstream f,g;
f.open("ssm.in",ios::in);
g.open("ssm.out",ios::out);
int n,i,in;
f>>n;
for (i=1;i<=n;i++)
{
f>>a;
if (sum<0)
{
sum=a;
in=i;
}
else
sum+=a;
if (sum>best)
{
best=sum;
inc=in;
sf=i;
}
}
g<<best<<" "<<inc<<" "<<sf;
}