Cod sursa(job #2859725)
Utilizator | Ilinca Popescu ilincap2008 | Data | 1 martie 2022 20:12:00 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream cin ("ssm.in");
ofstream cout ("ssm.out");
int n,i,v[6000005],s[8000005],j,x,in,sf,mx;
int main()
{
cin >>n;
for (i=1; i<=n; i++)
{
cin >>v[i];
s[i]=s[i-1]+v[i];
}
for (i=1; i<=n; i++)
{
for (j=i+1; j<=n; j++)
{
x=s[j]-s[i-1];
if (x>mx) {mx=x; in=i; sf=j;}
}
}
cout <<mx<<" "<<in<<" "<<sf;
return 0;
}