Cod sursa(job #3333903)
| Utilizator | Data | 15 ianuarie 2026 15:51:45 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
using namespace std;
int v[10000];
int main()
{
int n,inc,fin,maxs=-1000000000,scur=-1,cand;
cin>>n;
for(int i=1;i<=n;i++){
cin>>v[i];
if(scur<0){
scur=0;
cand=i;
}
scur+=v[i];
if(scur>maxs){
maxs=scur;
inc=cand;
fin=i;
}
}
cout<<maxs<<" "<<inc<<" "<<fin;
return 0;
}