Cod sursa(job #2211744)
Utilizator | Data | 11 iunie 2018 16:49:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,a[1010],s,smax=-INT_MAX,p1,p2,nr;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<n;i++)
{
s=a[i];
nr=0;
for(j=i+1;j<=n;j++)
{
s=s+a[j];
nr++;
if(s>smax)
{
smax=s;
p2=j;
p1=j-nr;
}
}
}
fout<<smax<<" "<<p1<<" "<<p2;
}