Cod sursa(job #1043078)
| Utilizator | Data | 27 noiembrie 2013 23:01:58 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,xi,smax,s,pozi,pozf,elem;
f>>n;
f>>elem;
smax=elem;
pozi=1;
pozf=1;
s=elem;
xi=1;
i=1;
while(i<=n-1)
{
i++;
f>>elem;
s=s+elem;
if(s>smax)
{
smax=s;
pozi=xi;
pozf=i;
}
if(s<0)
{
s=0;
xi=i+1;
}
}
g<<smax<<" "<<pozi<<" "<<pozf;
f.close();
g.close();
return 0;
}
