Cod sursa(job #3355596)
| Utilizator | Data | 23 mai 2026 13:47:25 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n;
fin >> n ;
int s[n];
int sum = 0 ;
int stg_fin = 0 , drpt_fin = 0 , sum_fin = 0;
int stg = 1 , drpt = 1 ;
for(int i = 1 ; i <= n ; i++)
{
fin >> s[i];
if(sum >= 0)
{
sum += s[i];
drpt = i ;
}
else
{
sum = s[i];
stg = i;
}
if(sum > sum_fin)
{
sum_fin = sum ;
stg_fin = stg;
drpt_fin = drpt;
}
}
fout << sum_fin <<' '<< stg_fin << ' ' << drpt_fin ;
return 0 ;
}