Cod sursa(job #2480129)
Utilizator | Data | 24 octombrie 2019 22:29:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,st,dr,staf,draf,s,maxim,a[6000006];
int main()
{
maxim=-2000000005;
fin >> n;
for(i=1;i<=n;i++)
{
fin >> a[i];
if (a[i]>s+a[i])
{
s=a[i];
st=i;
dr=i;
}
else
{
s+=a[i];
dr++;
}
if (s>maxim)
{
maxim=s;
staf=st;
draf=dr;
}
}
fout << maxim << " " << staf << " " << draf;
return 0;
}