Cod sursa(job #1337901)
Utilizator | Data | 9 februarie 2015 16:58:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 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=1,sc=-1,smax=-2000000000,k=1,h=1;
f>>n;
for(i=1;i<=n;i++)
{
f>>s[i];
if(sc<0)
{
sc=0;
k=i;
}
sc+=s[i];
if(sc>smax)
{
smax=sc;
j=i;h=k;
}
}
g<<smax<<" "<<h<<" "<<j;
f.close();
g.close();
return 0;
}