Cod sursa(job #2159622)
| Utilizator | Data | 11 martie 2018 04:07:59 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n;
fin>>n;
int now,max_now,max_sir,start_now=0,start_max=0,finish_max=0;
fin>>max_now;
max_sir=max_now;
for(int i=1;i<n;i++)
{
fin>>now;
if(max_now+now>=now)
{
max_now+=now;
}
else
{
max_now=now;
start_now=i;
}
if(max_sir<max_now)
{
max_sir=max_now;
start_max=start_now;
finish_max=i;
}
}
fout<<max_sir<<' '<<start_max+1<<' '<<finish_max+1<<'\n';
return 0;
}
