Cod sursa(job #862157)
Utilizator | Data | 22 ianuarie 2013 11:56:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, x[6000000],s,m,start, finish;
int main()
{ int i;
f>>n;
for(i=1; i<=n; i++)
f>>x[i];
for(i=1; i<=n; i++)
{
if( s+x[i]>x[i] )
s=s+x[i];
else
{
s=x[i];
start = i;
}
if(s>m)
{
m=s;
finish=i;
}
}
g<<m<<" "<<start<<" "<<finish;
}