Cod sursa(job #2276132)
| Utilizator | Data | 4 noiembrie 2018 11:22:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long n,a[6000001],st,dr,inc=1,maxim=INT_MIN;
int main()
{
in>>n;
a[0]=-1;
for(int i=1;i<=n;i++)
{
in>>a[i];
if(a[i-1]>=0&&a[i-1]+a[i]>=0)
a[i]+=a[i-1];
else
inc=i;
if(a[i]>maxim)
{
maxim=a[i];
st=inc;
dr=i;
}
}
out<<maxim<<' '<<st<<' '<<dr;
return 0;
}
