Cod sursa(job #1346379)
Utilizator | Data | 18 februarie 2015 10:54:08 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v,b=-9999999,a,p,l,h,u;
int main()
{
int n,i,nn;
in >> n;
nn=n;
in >> v;
n--;
while(n--)
{
in >> a;
v+=a;
if(a>v)
{
l=1;
h=nn-n;
v=a;
}
else
l++;
if(b<v)
{
p=h;
u=p+l-1;
b=v;
}
}
out << b << " " << p << " " << u;
return 0;
}