Cod sursa(job #3281408)
| Utilizator | Data | 1 martie 2025 13:39:33 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int NMAX=6e6;
int val;
int sum;
int start;
int main()
{
int n;
int max_sum,best_i=1,best_j=1;
fin>>n>>val;
sum=val;
max_sum=sum;
start=1;
for(int i=2;i<=n;i++)
{
fin>>val;
if(sum>=0)
sum=sum+val;
else
{
sum=val;
start=i;
}
if(sum>max_sum){
max_sum=sum;
best_j=i;
best_i=start;
}
}
fout<<max_sum<<" "<<best_i<<" "<<best_j;
return 0;
}
