Cod sursa(job #2398546)
| Utilizator | Data | 5 aprilie 2019 17:44:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,i,p,beg,en,sum,a,maxi=-9999;
int main()
{
cin>>n;
for(i=1;i<=n;++i)
{
cin>>a;
if(sum<0)
{
sum=a;
p=i;
}
else sum+=a;
if(sum>maxi)
{
maxi=sum;
beg=p;
en=i;
}
}
cout<<maxi<<" "<<beg<<" "<<en;
return 0;
}
