Submission #383119

#	Time	Username	Problem	Language	Result	Execution time	Memory
383119		Benmath	Rice Hub (IOI11_ricehub)	C++14	42 / 100	1089 ms	492 KiB

ricehub

int besthub(int r,int l, int x[],long long int b){   int maxi=1;
 for(int i=0;i<r;i++){
      long long int sum2=0;
      for(int j=i-1;j>=0;j--){
         sum2=sum2+x[i]-x[j];
         long long int sum3=0;
         for(int k=i;k<r;k++){
            sum3=sum3+x[k]-x[i];
            long long int sum=sum2+sum3;
            if(sum<=b){
               int x1=k-j+1;
               if(x1>maxi){
                  maxi=x1;
               }
            }
         }
      }
      
}
return maxi;
}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32