Cod sursa(job #1747097)
| Utilizator | Data | 24 august 2016 15:17:12 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int S,n,x,el,v[6000000],asdf,max1,f,incep;
int main()
{
in>>n;
for( int i=2 ; i<= n; i++)
{
in>>x;
if ( v[i-1] + x > x)
v[i] = v[i-1] + x;
else v[i] = x , asdf = i;
if (v[i] > max1)
{
max1=v[i];
f = i;
incep = asdf;
}
}
incep--;f--;
out<<max1 <<" "<< incep << " "<< f;
return 0;
}
