Cod sursa(job #3268882)
| Utilizator | Data | 17 ianuarie 2025 21:38:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int n,x,s,smax=0,primul=0,ultimul=0;
fin >> n;
int i;
fin >> s;
primul=1;
for(i=2;i<=n;i++){
fin >> x;
s+=x;
if(s > smax){
smax=s;
ultimul=i;
}
if(s <= 0){
primul=i+1;
s=0;
}
}
fout << smax << " " << primul << " " << ultimul;
return 0;
}