Cod sursa(job #3287377)
| Utilizator | Data | 17 martie 2025 17:53:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
long long int smax, sum[6000001];
int main()
{ int n, m, i , j,p,imax,jmax;
long long int v[6000001];
cin>>n;
for (i=1;i<=n;i++)
{cin>>v[i];
sum[i]=sum[i-1]+v[i];
}
for (i=1;i<=n;i++)
for (j=i;j<=n;j++)
if (sum[j]-sum[i-1]>smax) {smax=sum[j]-sum[i-1];
imax=i; jmax=j;
}
cout<<smax<<' '<<imax<<' '<<jmax;
return 0;
}
