Cod sursa(job #1716448)
Utilizator | Data | 12 iunie 2016 20:05:58 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
using namespace std;
#include<iostream>
#include<fstream>
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,a,i,bestsum,s,l,left,sum,right;
f>>n>>a;
s=a;
l=1;
bestsum=s;
for(i=2; i<=n; i++)
{
f>>a;
if(s<0)
{
s=a;
l=i;
}
else
s+=a;
if(bestsum<s)
{
bestsum=s;
left=l;
right=i;
}
}
g<<bestsum<<" "<<left<<" "<<right;
return 0;
}