Cod sursa(job #2640827)
| Utilizator | Data | 8 august 2020 15:10:46 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#define DIM 6000005
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long N, s[DIM], smax, sneg;
long long i1=1,i2;
int main()
{
f>>N;
for(long long i=1; i<=N; i++){
f>>s[i];
s[i] += s[i-1];
if(s[i] - sneg > smax){
smax = s[i] - sneg;
i2=i;
}
if(s[i] < sneg){
sneg = s[i];
i1 = i+1;
}
}
g<<smax<<" "<<i1<<" "<<i2;;
}
