Cod sursa(job #1782865)
Utilizator | Data | 18 octombrie 2016 16:45:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int x[1000],N, i, j, sum, aux[1000], maxx, st, dr;
void citire()
{
fin>>N;
for(i=1; i<=N; i++)
fin>>x[i];
}
int main()
{
citire();
for(i=1; i<=N; i++)
aux[i]=aux[i-1]+x[i];
maxx=-(1<<31)+1;
for(i=1; i<=N; i++)
for(j=i+1; j<=N; j++)
{
if(aux[j]-aux[i-1]>=maxx)
{ maxx=aux[j]-aux[i-1];
st=i; dr=j;
}
}
fout<<maxx<<" "<<st<<" "<<dr;
return 0;
}