Cod sursa(job #3142440)
Utilizator | Data | 21 iulie 2023 12:01:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
int n, i, j;
long long a[6000002];
struct posmax {int bgn; int end; long long sum=LONG_LONG_MIN;} maxim;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
in>>n;
for(i=1;i<=n;i++)
{
in>>a[i];
a[i]+=a[i-1];
}
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(a[j]-a[i]>maxim.sum)
maxim.sum=a[j]-a[i], maxim.bgn=i, maxim.end=j;
out<<maxim.sum<<" "<<maxim.bgn+1<<" "<<maxim.end;
return 0;
}