Cod sursa(job #2510323)
Utilizator | Data | 16 decembrie 2019 12:58:39 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,m,dr,st,x,y,smax,S,ok,i,j,v[101],s;
int main()
{f>>n;
j=1;
for(i=1;i<=n;i++)
{
f>>x;
if(s<0)
{
s=x;
j=i;
}
else
s+=x;
if(s>smax)
{
smax=s;
dr=i;
st=j;
}
}
g<<smax<<" "<<st<<" "<<dr;
return 0;
}