Cod sursa(job #3129825)
Utilizator | Data | 15 mai 2023 22:05:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,pozi=1,pozf,s,maxi=-6000000,p1,p2,v[6000005];
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=n;i++)
{
if(s<0)s=0,pozi=i;
s+=v[i];pozf=i;
if(s>maxi)
{
maxi=s;
p1=pozi;
p2=pozf;
}
}
g<<maxi<<" "<<p1<<" "<<p2;
return 0;
}