Cod sursa(job #1917615)
| Utilizator | Data | 9 martie 2017 12:38:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int i, j, n, x, s, nr, poz, pozmax, nrmax;
int smax=-2000000000;
int main()
{
fin>>n;
s=0;
for(i=1;i<=n;i++)
{
fin>>x;
s+=x;
poz=i;
nr++;
if(s<0)
{
s=0;
nr=0;
}
else if(s>smax)
{
smax=s;
pozmax=poz;
nrmax=nr;
}
}
fout<<smax<<' '<<pozmax-nrmax+1<<
' '<<pozmax;
return 0;
}
