Cod sursa(job #1604969)
| Utilizator | Data | 18 februarie 2016 18:21:38 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <limits>
#define L_MAX 10000000
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[L_MAX], mx[L_MAX+1], w[L_MAX];
int main()
{
int n, i, y, s, mn, smax=0, sol=0, nr, poz, st, dr;
f>>n; mx[0]=0;
for(i=1; i<=n; i++)
{
f>>nr;
if(smax<0)
{
smax=nr;
poz=i;
}
else smax+=nr;
if(smax>sol)
{
sol=smax;
st=poz;
dr=i;
}
}
g<<sol<<" "<<st<<" "<<dr;
return 0;
}
