Cod sursa(job #1248875)
Utilizator | Data | 26 octombrie 2014 10:25:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
long long n,a[6000001],s,Max,p,x,y,i;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
f>>n;
for (i=1; i<=n; i++) f>>a[i];
s=a[1];
Max=a[1];
p=1;
x=1;
y=1;
for (i=2; i<=n; i++)
{
if (s>=0) s=s+a[i];
else
{
p=i;
s=a[i];
}
if (s>Max)
{
Max=s;
x=p;
y=i;
}
}
g<<Max<<" "<<x<<" "<<y;
return 0;
}