Cod sursa(job #1337860)
Utilizator | Data | 9 februarie 2015 16:32:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int s[6000001];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,j,sc=-1,smax=-99999999,k;
f>>n;
for(i=1;i<=n;i++)
{
if(sc<0)
{
sc=0;
k=i;j=i;
}
f>>s[i];
sc+=s[i];
if(sc>smax)
{
smax=sc;
j=i;
}
}
g<<smax<<" "<<k<<" "<<j;
f.close();
g.close();
return 0;
}