Cod sursa(job #1875574)
| Utilizator | Data | 11 februarie 2017 12:19:47 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int sp[6000001],n,x;
memset(sp,0,sizeof(sp));
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>x;
sp[i]=sp[i-1]+x;
}
int in,out,maxs=0;
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
if(sp[j]-sp[i-1]>maxs)
{
maxs=sp[j]-sp[i-1];
in=i;
out=j;
}
}
}
fout<<maxs<<' '<<in<<' '<<out;
return 0;
}
