Cod sursa(job #1515828)
| Utilizator | Data | 2 noiembrie 2015 11:40:05 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,x,y,s,a[6000002],z,p,pmaxim,umaxim,maxim;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
for(i=1;i<=n;i++)
{
if(s+a[i]>=a[i])
{
s+=a[i];
}
else
{
s=a[i];
p=i;
}
if(s>maxim)
{
maxim=s;
pmaxim=p;
umaxim=i;
}
}
fout<<maxim<<" "<<pmaxim<<" "<<umaxim;
return 0;
}
