Cod sursa(job #2308319)
Utilizator | Data | 26 decembrie 2018 20:52:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
long long n,i,nr,s_max=0,s=0,poz1,ok=0,poz2,poz;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>nr;
s+=nr;
if(s>s_max)
{
s_max=s;
poz2=i;
poz1=poz;
}
if(s<0)
{
s=0;
poz=i+1;
}
}
//ok++;
cout<<s_max<<" "<<poz1<<" "<<poz2;
}