Cod sursa(job #2569033)
| Utilizator | Data | 4 martie 2020 10:51:56 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | r3capitusulare | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long int n, a[6000000], i, j, k, mx=0, sum, pi, pf;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
mx=0;
pi=1;
pf=n;
for(i=1;i<=n/2;i++)
{
for(k=1;k<=n/2;k++)
{
sum=0;
for(j=i+1;j<=n-k;j++)
sum+=a[j];
if(sum>mx)
{
mx=sum;
pi=i+1;
pf=n-k;
}
}
}
fout<<mx<<" "<<pi<<" "<<pf;
return 0;
}
