Cod sursa(job #2550712)
| Utilizator | Data | 19 februarie 2020 08:21:36 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,sir[6000005],bestsuma=-int(2e9),mini,idx,inc,fin;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>sir[i];
for(int i=1;i<=n;i++)
{
sir[i]+=sir[i-1];
if(bestsuma<sir[i]-mini)
bestsuma=sir[i]-mini,inc=idx+1,fin=i;
if(mini>sir[i])
mini=sir[i],idx=i;
}
cout<<bestsuma<<" "<<inc<<" "<<fin;
return 0;
}
