Cod sursa(job #2127843)
Utilizator | Data | 11 februarie 2018 09:43:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,v[10001],in,sf,smax,s;
int main()
{
fin >>n;
for(int i=1; i<=n; i++)
fin>> v[i];
for(int i=1; i<=n; i++)
{
s=0;
for(int j=i; j<=n; j++)
{
s+=v[j];
if(s>smax)
{
in=i;
sf=j;
smax=s;
}
}
}
fout <<in<<' '<<sf;
return 0;
}