Cod sursa(job #2246093)
Utilizator | Data | 26 septembrie 2018 17:26:59 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long n,a[6000100],i,j,im,jm,s=-INT_MAX,smax=-INT_MAX;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
s=0;
for(j=i;j<=n;j++)
{
s=s+a[j];
if(s>smax)
{
smax=s;
jm=j;
im=i;
}
}
}
fout<<smax<<" "<<im<<" "<<jm;
}