Cod sursa(job #3245738)
| Utilizator | Data | 30 septembrie 2024 13:25:03 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int n,mi=0,mf=0,maxi=-2000000,ia=1,fa=0;
cin>>n;
int nr,sac=0;
for(int i=1;i<=n;i++){
cin>>nr;
sac+=nr;
fa++;
if(sac>maxi){
maxi=sac;
mi=ia;
mf=fa;
}
if(sac<0){
sac=0;
ia=i+1;
fa=i;
}
}
cout<<maxi<< ' ' <<mi<< ' ' <<mf;
return 0;
}
