Cod sursa(job #1348229)
Utilizator | Data | 19 februarie 2015 16:21:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int v[6000000],sp[6000000];
int main()
{
int n,i,j,S=0,in,sf,maxx=0;
f>>n;
for (i=1;i<=n;++i)
{f>>v[i];sp[i]=sp[i-1]+v[i];}
for (i=1;i<=n;++i)
{
for (j=i;j<=n;++j)
{
S=sp[j]-sp[i-1];
if (S>maxx)
{
maxx=S;sf=j;in=i;
}
}
}
g<<maxx<<' '<<in<<' '<<sf;
return 0;
}