Cod sursa(job #1946756)
| Utilizator | Data | 30 martie 2017 13:50:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,l,r,a[6000000],sum[6000000],best[6000000],BestSum=-999999999,mi;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
sum[i]=sum[i-1]+a[i];
}
mi=sum[0];
for(i=1;i<=n;i++)
{
best[i]=sum[i]-mi;
if(mi>sum[i])
{
mi=sum[i];
l=i+1;
}
if(BestSum<best[i])
{
BestSum=best[i];
r=i;
}
}
g<<BestSum<<" "<<l<<" "<<r;
return 0;
}
