Cod sursa(job #3344566)
| Utilizator | Data | 2 martie 2026 13:08:02 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <iomanip>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
deque <int> dq;
long long int n,k,v[6000005],sum=0,st=0,dr=0,stmax,drmax,sumax;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
sumax=v[1];
sum=v[1];
stmax=1;
drmax=1;
for(int i=2;i<=n;i++)
{
sum+=v[i];
if(sum>sumax)
{
sumax=sum;
stmax=st;
drmax=i;
}
if(sum<0)
{
sum=0;
st=i+1;
}
}
fout<<sumax<<" "<<stmax<<" "<<drmax;
return 0;
}
