Cod sursa(job #2454907)
Utilizator | Data | 10 septembrie 2019 10:39:27 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 75 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
int n,i=0,j=0,s=0,mi=0,ma=0,st=0,dr=0,x;
scanf("%d0",&x);
for(j=1;j<=x;j++)
{
scanf("%d",&n);
i++;
s=s+n;
if(s<mi)
{
mi=s;
st=i+1;
}
if(s-mi>ma && i>st)
{
ma=s-mi;
dr=i;
}
}
printf("%d %d %d",ma,st,dr);
return 0;
}