Cod sursa(job #1914022)
Utilizator | Data | 8 martie 2017 15:09:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int x[6000001], s[6000001], i, j, n, smax, ii, is;
int main()
{
fin>>n;
for(i=1; i<=n; ++i) fin>>x[i];
s[0]=0;
for(i=1; i<=n; ++i)
{
s[i]=x[i]+s[i-1];
}
for(i=0; i<n; ++i)
{
for(j=i+1; j<=n; ++j)
{
if(s[j]-s[i]>smax)
{
smax=s[j]-s[i];
ii=i+1;
is=j;
}
}
}
fout<<smax<<" "<<ii<<" "<<is;
return 0;
}