Cod sursa(job #1904292)
Utilizator | Data | 5 martie 2017 14:06:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long int n,sum=0,best=0,st,dr,i,x,p;
int main()
{
f>>n;
st=dr=1;
for(i=1;i<=n;i++)
{
f>>x;
if(i==1) best=x;
if(sum<0)
{
p=i;
sum=x;
}
else sum+=x;
if(sum>best)
{
best=sum;
st=p;
dr=i;
}
}
g<<st<<' '<<dr;
return 0;
}