Cod sursa(job #2152547)
Utilizator | Data | 5 martie 2018 17:27:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v,i,j,i1,j1,n,smax,s;
int main()
{
fin>>n;
smax=-2000000000;
i=1;
s=0;
for(j=1;j<=n;j++)
{
fin>>v;
s=s+v;
if(s>smax)
{
smax=s;
i1=i;
j1=j;
}
if(s<0)
{
s=0;
i=j+1;
}
}
fout<<smax<<" "<<i1<<" "<<j1;
fin.close();
fout.close();
return 0;
}