Cod sursa(job #3285363)
Utilizator | Data | 12 martie 2025 19:32:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n , t ,start,p1,p2,i,j,v[6000001];
long long s,smax;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
p1=p2=0;
start=1;
s=0;
for(i=1;i<=n;i++)
{
if(s<0)
{
start=i;
s=0;
}
s=s+v[i];
if(s>smax)
{
smax=s;
p1=start;
p2=i;
}
}
fout<<smax<<" "<<p1<<" "<<p2;
return 0;
}