Cod sursa(job #2033406)
| Utilizator | Data | 6 octombrie 2017 19:23:57 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a,s[6000005],st,dr,rezst,rezdr,maxi=-2000000000,n,rez;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>a;
if(i==1)
s[i]=a;
if(s[i-1]+a<a)
{
s[i]=a;
st=i;
dr=i;
}
else
{
s[i]=s[i-1]+a;
dr++;
if(s[i]>maxi)
{
rezst=st;
rezdr=dr;
rez=s[i];
maxi=s[i];
}
}
}
fout<<rez<<" "<<rezst<<" "<<rezdr;
return 0;
}
