Cod sursa(job #1548159)
Utilizator | Data | 10 decembrie 2015 16:51:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,v[6000100],i,j,i0,i1,s,mx;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
j=1;
i=1;
mx=v[1];
s=v[1];
while(j<=n)
{
if(s<0 && i<j)
{
s=v[j];
i=j;
}
else
{
j++;
s+=v[j];
}
if(s>mx)
{
mx=s;
i0=i;
i1=j;
}
}
g<<mx<<' '<<i0<<' '<<i1;
}