Cod sursa(job #1913532)
| Utilizator | Data | 8 martie 2017 13:06:57 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#define MAXN 6000010
#define INF 1900000000
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[MAXN],s,n,smax,pi,pf,pic;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
smax=-INF;
s=v[1];
for(int i=2;i<=n;i++)
{
if(s>smax)
{
smax=max(smax,s);
pi=pic;
pf=i-1;
}
if(s<0)
{
s=v[i];
pic=i;
}
else
s+=v[i];
}
g<<smax<<' '<<pi<<' '<<pf;
return 0;
}
