Cod sursa(job #2871002)
Utilizator | Data | 12 martie 2022 19:42:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
#define maxn 7000005
int main()
{
int n,s,sum=0,beg,fin,idx;
int bestSum=-int(2e9);
f>>n;
for(int i=1;i<=n;i++)
{
f>>s;
if(sum<0)
{
sum=s;
idx=i;
}
else
sum+=s;
if(bestSum<sum)
bestSum=sum,beg=idx,fin=i;
}
g<<bestSum<<" "<<beg<<" "<<fin;
return 0;
}