Cod sursa(job #1520228)
Utilizator | Data | 8 noiembrie 2015 15:20:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[7000005],n;
int sum=0,bsum=-32766,beg,endi,ind;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>s[i];
}
for(int i=1;i<=n;i++)
{
if(sum<0)
{
sum=s[i];
ind=i;
}
else
sum+=s[i];
if(bsum<sum)
{
bsum=sum;
beg=ind;
endi=i;
}
}
fout<<bsum<<" "<<beg<<" "<<endi;
}