Cod sursa(job #1245923)
Utilizator | Data | 20 octombrie 2014 11:29:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n,Max,s,x,y,j,a[6000000];
int main()
{
f>>n; Max=-9999;
for (i=1;i<=n;i++) f>>a[i];
for (i=1;i<=n-1;i++)
{
s=a[i];
if (s>Max)
{
Max=s;
x=i;
y=i;
}
for (j=i+1;j<=n;j++)
{
s+=a[j];
if (s>Max)
{
Max=s;
x=i;
y=j;
}
}
}
g<<Max<<" "<<x<<" "<<y;
return 0;
}