Cod sursa(job #1379718)
| Utilizator | Data | 6 martie 2015 19:07:20 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#define NMax 6000001
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[NMax], i, n, p, first, last, Smax=-int(2e9), Min;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
a[i]+=a[i-1];
if(a[i]-Min>Smax) Smax=a[i]-Min, first=p+1, last=i;
if(a[i]<Min) Min=a[i], p=i;
}
g<<Smax<<' '<<first<<' '<<last;
return 0;
}
