Cod sursa(job #1722923)
| Utilizator | Data | 29 iunie 2016 13:17:31 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int best,imax1,imax2,jmax,i,j,n,x,maxi;
int main()
{
f>>n;
imax1=1; imax2=1;
jmax=0;
maxi=-2147483647;
best=0;
for(i=1;i<=n;i++)
{
f>>x;
if(best+x>x)
{
best=best+x;
}
else
{
best=x;
imax1=i;
}
if(best>maxi) imax2=imax1, jmax=i, maxi=best;
}
g<<maxi<<' '<<imax2<<' '<<jmax<<' ';
return 0;
}
