Cod sursa(job #2421663)
Utilizator | Sirbu Alexandru alex.sirbu | Data | 15 mai 2019 17:53:46 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
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");
void read(){
int n;
fin>>n;
int start=1, finish=1;
long long x;
fin>>x;
long long sumMax=x, current=x;
for(int i=2; i<=n; i++){
fin>>x;
current=max(current+x, x);
if(current==x) start=i;
if(current>sumMax) sumMax=current, finish=i;
}
cout<<sumMax<<' '<<start<<' '<<finish;
}
int main()
{
read();
return 0;
}