Cod sursa(job #2033547)
| Utilizator | Data | 6 octombrie 2017 23:11:07 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long s=0;
int a[6000005];
int main()
{
int i,n,j=1,dr,st,maxx=-99999999,x;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
for(i=1;i<=n;i++)
{
s=s+a[i];
if(s>maxx)
{
maxx=s;
dr=j;
st=i;
}
if(s<a[i])
{
s=0;
j=i;
i--;
}
}
fout<<maxx<<" "<<dr<<" "<<st;
return 0;
}
