Cod sursa(job #1378739)
| Utilizator | Data | 6 martie 2015 13:59:26 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int N,i,suma,pozst,pozfn;
struct elem
{
int val,poz;
}v[6000001];
int main()
{
f>>N;
for (i=1;i<=N;++i)
{
f>>v[i].val;
v[i].poz=i;
if (v[i].val<v[i].val+v[i-1].val)
{
v[i].val=v[i].val+v[i-1].val;
v[i].poz=v[i-1].poz;
}
if (v[i].val>suma)
{
suma=v[i].val;
pozst=v[i].poz;
pozfn=i;
}
}
g<<suma<<' '<<pozst<<' '<<pozfn;
f.close();g.close();
return 0;
}
