Cod sursa(job #1449261)
| Utilizator | Data | 9 iunie 2015 09:38:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
#include <cstdlib>
#include <ctime>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n, x, st=1, fini=1, s, smax, stmax, mare, poz=1;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>x;
if(i==1)
mare=x;
if(x>mare)
{
mare=x;
poz=i;
}
s=s+x;
if(s<0)
{
s=0;
st=i+1;
}
if(s>smax)
{
stmax=st;
smax=s;
fini=i;
}
}
if(mare<=0)
{
smax=mare;
stmax=fini=poz;
}
fout<<smax<<' '<<stmax<<' '<<fini;
return 0;
}
