Mai intai trebuie sa te autentifici.
Cod sursa(job #3159304)
Utilizator | Data | 21 octombrie 2023 09:17:08 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,k,S,Smax,A[6000000],st,dr;
int main()
{
fin>>n;
Smax=-20000000;
for(i=1;i<=n;i++)
{
fin>>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 > Smax)
Smax = S, st = i, dr = j;
}
fout<<Smax<<" ";
fout<<st<<" "<<dr;
return 0;
}