Cod sursa(job #2203815)
| Utilizator | Data | 13 mai 2018 11:37:03 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int N = 1<<31;
int n,s,sm,pm,st,dr,sol,i,x;
int main()
{
f>>n;
sol=N;
st=dr=n+1;
for(i=1;i<=n;i++)
{
f>>x;
s+=x;
if(s-sm>sol)
{
sol=s-sm;
st=pm+1;
dr=i;
}
if(s<sm)
{
sm=s;
pm=i;
}
}
g<<sol<<" "<<st<<" "<<dr;
return 0;
}
