Cod sursa(job #1926235)
Utilizator | Data | 14 martie 2017 09:44:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long x,n,i,i1,i2,i1m,i2m,s,smax;
int main()
{
f>>n;
i1=1;
for(i=1;i<=n;++i)
{
f>>x;
if(i==1)
smax=x;
i2++;
s+=x;
if(s>smax)
smax=s,i1m=i1,i2m=i2;
if(s<0)
s=0,i1=i2+1;
}
g<<smax<<" "<<i1m<<" "<<i2m;
return 0;
}