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