Cod sursa(job #3340881)
| Utilizator | Data | 16 februarie 2026 21:32:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int N;
fin>>N;
int st, bestst,bestdr;
long long sum;
fin>>sum;
long long bestsum=sum;
bestst=1;
bestdr=1;
for(int i=2; i<=N; i++){
if(sum<0){
st=i;
fin>>sum;
}else{
long long e;
fin>>e;
sum+=e;
}
if(bestsum<sum){
bestsum=sum;
bestst=st;
bestdr=i;
}
}
fout<<bestsum<<' '<<bestst<<' '<<bestdr;
return 0;
}
