Cod sursa(job #667862)
Utilizator | Iacob Robert LisBase | Data | 23 ianuarie 2012 20:44:25 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int a[6000001];
int main()
{
int n,i,maxim,s,st,dr,poz;
ifstream fin ("ssm.in");
fin>>n;
for (i=1;i<=n;i++)
{
fin>>a[i];
}
fin.close();
st=dr=1;
maxim=a[1];
s=a[1];
poz=1;
if (s<0)
{
s=0;
poz=2;
}
for(i=2;i<=n;i++)
{
s=s+a[i];
if (s>maxim)
{
maxim=s;
dr=i;
st=poz;
}
if (s<0)
{
s=0;
poz=i+1;
}
}
ofstream fout ("ssm.out");
fout<<maxim<<" "<<st<<" "<<dr;
fout.close();
return 0;
}