Cod sursa(job #1124252)
Utilizator | Data | 26 februarie 2014 11:53:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
using namespace std;
long i,n,s,smax,a[6000002],j,l,p;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>a[i];
}
smax=-2000000000;
for(i=1;i<=n;i++)
{ s=0;
for(j=i;j<=n;j++)
{
s=s+a[j];
if(s>smax)
{
smax=s;
p=i;
l=j;
}
}
}
g<<smax<<""<<p<<" "<<l<<'\n';
g.close();
f.close();
return 0;
}