Cod sursa(job #1284533)
| Utilizator | Data | 6 decembrie 2014 16:27:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <time.h>
using namespace std;
fstream fin("ssm.in");
ofstream fout("ssm.out");
int a[7000005];
int main()
{
int incep,sfarsit,suma,i,j,k,smax,n;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
smax=a[1];
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
suma=0;
for(k=i;k<=j;k++)
suma+=a[k];
if(suma>smax) smax=suma,incep=i,sfarsit=j;
}
fout<<smax<<' '<<incep<<' '<<sfarsit;
return 0;
}
