Mai intai trebuie sa te autentifici.
Cod sursa(job #2710429)
| Utilizator | Data | 22 februarie 2021 16:15:50 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int i,j,maxim,maxi,maxj,x,n,s[6000005];
int main()
{
fin >> n;
fin >> s[1];
for(i=2;i<=n;i++)
{
fin >> x;
s[i]=s[i-1]+x;
}
for(i=1;i<n;i++)
{
for(j=i+1;j<=n;j++)
{
if(s[j]-s[i-1]>maxim)
{
maxim=s[j]-s[i-1];
maxi=i;
maxj=j;
}
}
}
fout << maxim << ' ' << maxi << ' ' << maxj;
return 0;
}
