Cod sursa(job #3357566)
| Utilizator | Data | 11 iunie 2026 16:02:16 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000001],st,dr,i,j,n,stCurent;
long long s, maxim;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
s = v[1];
stCurent = 1;
maxim = s;
st = 1;
dr = 1;
for(i = 2; i <= n; i++){
if (s < 0){
s = v[i];
stCurent = i;}
else
s = s + v[i];
if (s > maxim){
maxim = s;
st = stCurent;
dr = i;}
}
fout<<maxim<<" "<<st<<" "<<dr;
return 0;
}
