Cod sursa(job #1921503)
| Utilizator | Data | 10 martie 2017 12:57:00 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,s,smax,x,p=1,u,i,pout,uout;
long long int mini=6000000;
int main()
{
fin>>n;
fin>>x;
s=x; smax=s; p=1;
for(i=2;i<=n;i++)
{
fin>>x;
if(s+x>=x) s+=x;
else s=x, p=i;
if(s==smax && i-p<mini )
mini=i-p, pout=p, uout=i;
if(s>smax)
smax=s, pout=p, uout=i;
}
fout<<smax<<' '<<pout<<' '<<uout<<'\n';
return 0;
}
