Cod sursa(job #2802207)

Utilizator danutbodbodnariuc danut danutbod Data 17 noiembrie 2021 19:10:17
Problema Subsecventa de suma maxima Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.61 kb
////O(n^3)
//15p cu int
//20p cu long long
#include <fstream>
#define N 6000003
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
//int   a[N],smax,s,p1,p2,i,j,k,n;
long long  a[N],smax,s,p1,p2,i,j,k,n;

int main() {
    f>>n;
    for(i=1;i<=n;i++)f>>a[i];
    smax=-3000000000000000;
    for(i=1;i<=n;i++)  //toate sumele
     for(j=i;j<=n;j++)
       {
          //suma de la a[i] la a[j]
          s=0;
          for(k=i;k<=j;k++)
            s=s+a[k];
          if(s>smax){smax=s;p1=i;p2=j;}
       }
    g<<smax<<" "<<p1<<" "<<p2;
    f.close();
    g.close();
    return 0;
}