Cod sursa(job #2555893)
Utilizator | Cighi Vasile Cighi | Data | 24 februarie 2020 15:08:36 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,j,mx,s[6000005],c,dr,st;
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>s[i];
s[i]=s[i-1]+s[i];
}
mx=s[1];
for(i=1; i<=n; i++)
for(j=i; j<=n; j++)
if(s[i]>(s[j]-s[i]))
{
if(s[i]>mx)
{
mx=s[i];
st=i;
dr=j;
}
}
else if(s[j]-s[i]>mx)
{
mx=s[j]-s[i];
st=i+1;
dr=j;
}
g<<mx<<" "<<st<<" "<<dr;
}