Cod sursa(job #2555890)

Utilizator CighiCighi Vasile Cighi Data 24 februarie 2020 15:01:48
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.64 kb
#include <iostream>

using namespace std;
int n,i,j,mx,s[1000],c,dr,st;
int main()
{
    cin>>n;
    for(i=1; i<=n; i++)

    {
        cin>>s[i];
        s[i]=s[i-1]+s[i];
    }
    mx=s[1];
    for(i=1; i<=n; i++)
        for(j=i; j<=n; j++)
            if(s[i]>(s[j]-s[i]))
            {
                if(s[i]>mx)
                {
                    mx=s[i];
                    st=i;
                    dr=j;
                }
            }
            else if((s[j]-s[i])>mx)
            {
                mx=s[j]-s[i];
                st=i+1;
                dr=j;
            }
    cout<<mx<<" "<<st<<" "<<dr;
}