Cod sursa(job #3348447)
| Utilizator | Data | 22 martie 2026 09:55:47 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int main()
{
int n;
cin>>n;
long long y,lf=0,rg=0,smax=-2e9,tsu=0,smini=0,tlf=0;
for(int i=1;i<=n;i++){
cin>>y;
tsu+=y;
if(tsu-smini>smax){
smax=tsu-smini;
lf=tlf+1;
rg=i;
}
if(tsu<smini){
smini=tsu;
tlf=i;
}
}
cout<<smax<<" "<<lf<<" "<<rg;
return 0;
}
