Cod sursa(job #2354725)
| Utilizator | Data | 25 februarie 2019 15:26:56 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std ;
ifstream f ("ssm.in") ;
ofstream g ("ssm.out") ;
int N , K , V[100010] ;
int dr , st;
long long sact = 0 , smax ;
int main()
{
f >> N ;
for (int i = 1 ; i <= N ; ++i)
f >> V[i];
smax = sact = V[1] ;
st = dr = 1;
for (int i = 2 ; i <= N ; ++i)
{
if (sact < 0) sact = V[i] , st = dr = i;
else sact += V[i] ;
if (sact > smax) smax = sact , dr = i ;
}
g << smax << ' ' << st << ' ' << dr << '\n' ;
return 0;
}
