Mai intai trebuie sa te autentifici.
Cod sursa(job #2491202)
Utilizator | Data | 12 noiembrie 2019 00:17:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int mx=INT_min;
int v[1000];
int n,poz=0,pozsf=0,s;
int main()
{
fin>>n;
for(int i=1;i<=n;++i)
fin>>v[i];
for(int k=1;k<=n;++k)
{
for(int i=1;i<=n-k+1;++i)
{
s=0;
for(int j=i;j<=i+k-1;++j)
{
s=s+v[j];
}
if(s>mx)
{
mx=s;
poz=i;
pozsf=i+k-1;
}
}
}
fout<<mx<<' '<<poz<<' '<<pozsf;
return 0;
}