Cod sursa(job #3314523)
| Utilizator | Data | 10 octombrie 2025 12:04:03 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,v[6000005],i,j,smax,lmax,rmax;
int main()
{
v[0]=0;
smax=INT_MIN;
fin>>n;
for (i=1;i<=n;i++)
{
fin>>v[i];
v[i]=v[i]+v[i-1];
}
for (i=1;i<=n;i++)
for (j=i+1;j<=n;j++)
{
//cout<<i<<" "<<j<<": "<<v[j]-v[i-1]<<" "<<smax<<endl;
if (v[j]-v[i-1]>smax)
{
smax=v[j]-v[i-1];
lmax=i;
rmax=j;
}
}
fout<<smax<<" "<<lmax<<" "<<rmax;
return 0;
}
