Cod sursa(job #1348416)
Utilizator | Data | 19 februarie 2015 18:08:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
//subsegventa de suma maxima
//#include<iostream>
#include<fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("smm.out");
int v,a,h,l,b=-999999,p,u;
int main()
{
int n,m;
cin>>n;
m=n;
cin>>v;
n--;
while(n--)
{
cin>>a;
v=v+a;
if(a>v)
{
l=1;
h=m-n;
v=a;
}
else
l++;
if(b<v)
{
p=h;
u=p+l-1;
b=v;
}
}
cout<<b<<" "<<p<<" "<<u;
return 0;
}