Cod sursa(job #1841698)
Utilizator | Data | 5 ianuarie 2017 21:48:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,q;
int begsum=-int(2e9),beg,endi,ind,sum=0;
fin>>n;
for(int i=0;i<n;i++)
{
fin>>q;
if(sum<0)
{
sum=q;
ind=i;
}
else
{
sum+=q;
}
if(begsum<sum)
{
begsum=sum;
beg=ind;
endi=i;
}
}
fout<<begsum<<' '<<beg<<' '<<endi;
return 0;
}