Cod sursa(job #3159317)
Utilizator | Pop Alexandru-Ionut Ionut4428 | Data | 21 octombrie 2023 09:29:52 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <iostream>
using namespace std;
int n,nr,best,i,besti,MAX=-1000000,mini;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
fin>>n;
fin>>best;
mini=1;
for (i=2;i<=n;i++)
{
fin>>nr;
if (best+nr>nr)
{
best=best+nr;
}
else
best=nr,mini=i;
if (best>MAX)
{
MAX=best;
besti=i;
}
}
fout<<MAX<<" "<<mini<<" "<<besti;
return 0;
}