Cod sursa(job #1990089)
Utilizator | Data | 10 iunie 2017 14:54:47 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int smin,pozmin,n,x,s,st,dr,bst;
int main()
{
f>>n>>x;
bst=x;
st=dr=1;
s=x;
if(x<0)
{
smin=x;
pozmin=1;
}
for(int i=2;i<=n;i++)
{
f>>x;
s+=x;
if(s-smin>bst)
{
bst=s-smin;
dr=i;
st=pozmin+1;
}
if(s<smin)
{
smin=s;
pozmin=i;
}
}
g<<bst<<' '<<st<<' '<<dr;
}