Cod sursa(job #2407236)
Utilizator | Data | 16 aprilie 2019 18:17:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int MAX=6000000;
int n,a[MAX],x,y,s,sol=-1000000000;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=n;i++)
{
for(int j=i;j<=n;j++)
{
s=0;
for(int k=i;k<=j;k++)
s+=a[k];
if(s>sol)
{
sol=s;
x=i;
y=j;
}
}
}
g<<s<<' '<<x<<' '<<y;
return 0;
}