Cod sursa(job #1782862)
Utilizator | Data | 18 octombrie 2016 16:44:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
#include <limits.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,a[6000001],maxim=INT_MIN,i,s[60000001],j,x,y;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
s[i]=s[i-1]+a[i];
}
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
if(s[j]-s[i-1]>maxim)
{
x=i;
y=j;
maxim=s[j]-s[i];
}
}
}
g<<maxim<<' '<<x<<' '<<y;
return 0;
}