Cod sursa(job #2138369)
Utilizator | Groza Mihai mihaigroza | Data | 21 februarie 2018 16:29:43 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n,v[6000010],best[6000010],maxx=-99999999,poz,p;
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>v[i];
if(v[i]<v[i]+best[i-1])
best[i]=v[i]+best[i-1];
else
best[i]=v[i];
if(best[i]>maxx)
{
maxx=best[i];
poz=i;
}
}
p=poz;
while(p>0 and best[p]>=0)
p--;
if(p==poz)
p--;
g<<best[poz]<<" "<<p+1<<" "<<poz;
}