Cod sursa(job #701860)
Utilizator | Data | 1 martie 2012 18:10:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
int n,i,s=0,aux=0,a[6000000],c,k;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
s=0;
aux=0;
k=1;
for(i=1;i<=n;i++)
{
s=s+a[i];
if(s>aux)
{
aux=s;
c=i;
}
if(s<=0)
{
s=0;
k=i;
}
}
k++;
fout<<aux<<" "<<k<<" "<<c;
fin.close();
fout.close();
}