Cod sursa(job #3159415)
| Utilizator | Data | 21 octombrie 2023 11:53:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,im,it,jm;
fin>>n;
long long maxit=-int(2e9),maxi=-int(2e9);
for(int i=1;i<=n;++i){
long long s;
fin>>s;
if(maxi<0){
maxi=s;it=i;
}
else{
maxi+=s;
}
if(maxi>maxit){
maxit=maxi;im=it;jm=i;
}
}
cout<<maxit<<" "<<im<<" "<<jm;
return 0;
}
