Cod sursa(job #670098)
Utilizator | Iorga Andreea andreea29 | Data | 28 ianuarie 2012 12:52:43 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<iostream>
#include<fstream>
#define Infi -0x3f3f3f3f
using namespace std;
int a[6000100], n, i, s=0, best, ind, in, sf;
int main()
{
ifstream f("ssm.in");
ofstream h("ssm.out");
f>>n;
for (i=1; i<=n; ++i)
f>>a[i];
f.close();
best=Infi;
for (i=1; i<=n; ++i)
{
if (s<0)
{
s=a[i];
ind=i;
}
else
s+=a[i];
if (best<s)
{
best=s;
in=ind;
sf=i;
}
}
h<<best<<" "<<in<<" "<<sf<<'\n';
h.close();
return 0;
}