Cod sursa(job #2375580)
Utilizator | Data | 8 martie 2019 10:50:47 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int s,i,a[100001],bests,pozi,pozf,n,x,in;
int main()
{
f>>n;
pozi=1;
bests=-1000001;
for(i=1;i<=n;i++)
{
f>>x;
if(s<0)
{
s=x;
in=i;
}
else
s+=x;
if(bests<s)
bests=s,pozi=in,pozf=i;
}
g<<bests<<" "<<pozi<<" "<<pozf;
return 0;
}