Cod sursa(job #2716532)
Utilizator | Gozner Mate MateGM | Data | 5 martie 2021 12:08:37 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <vector>
using namespace std;
int main()
{
ifstream be("ssm.in");
ofstream ki("ssm.out");
int n;
be>>n;
int y;
int sum=0;
int best=-(1<<30);
int idx_k=0,idx_v=0,idx=0;
for(int i=1;i<=n;i++)
{
be>>y;
if(sum<0)
{
idx=i;
sum=y;
}
else sum+=y;
if(sum>best)
{
best=sum;
idx_k=idx;
idx_v=i;
}
}
ki<<best<<" "<<idx_k<<" "<<idx_v;
return 0;
}