Cod sursa(job #1586272)
Utilizator | Data | 31 ianuarie 2016 22:53:34 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,smax,v[100],p,u,lg,s,j;
int main()
{fin>>n;
for(i=1;i<=n;i++)
{fin>>v[i];}
smax=v[1];
for(i=1;i<=n;i++)
{s=0;
for(j=i;j<=n;j++)
{s=s+v[j];
if(smax<s)
{smax=s;
lg=j-i;
p=i;}
}
}
fout<<smax<<" "<<p<<" "<<p+lg;
return 0;
}