Cod sursa(job #2673104)

Utilizator Teo.gruescuTeo Gruescu Teo.gruescu Data 15 noiembrie 2020 19:16:46
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.56 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");

int n,i,j,finala,initial;
long long v[6000005],s[6000005];

int main()
{
    s[0]=0;
   f>>n;
   for (i=1;i<=n;i++)
   {
       f>>v[i];
       s[i]=s[i-1]+v[i];
   }
   for(i=1;i<=n;i++)
   {
       for(j=1;j<=n;j++)
       {
           if(s[i]-s[j-1]>s[0])
           {
               s[0]=s[i]-s[j-1];
                initial=j-1;
                finala=i;
           }
       }
   }
        g<<s[0]<<" "<<initial<<" "<<finala;

    return 0;
}