oj.uz

Submission #16438

# Submission time Handle Problem Language Result Execution time Memory
16438 2015-08-25T03:14:44 Z chan492811 Rice Hub (IOI11_ricehub) C++
0 / 100
 4 ms 5772 KB 
#include "ricehub.h"
#include <algorithm>
using namespace std;
long long n,m,left,right;
long long b,l,max1,now;
long long arr[100010];
int besthub(int R, int L, int X[], long long B)
{
    long long i;
    long long temp;
    n=(long long)R; l=(long long)L; b=B;
    for(i=0;i<n;i++){
        arr[i]=(long long)X[i];
    }
    while(right<n && now<=b){
        now+=arr[right++]-arr[0];
    }max1=max(max1,right-left);
    for(i=1;i<n;i++){
        now+=(i-left)*(arr[i]-arr[i-1]);
        now-=(right-i)*(arr[i]-arr[i-1]);
        while(now>b){
            if((arr[right-1]-arr[i])>(arr[i]-arr[left])){
                now-=arr[right-1]-arr[i]; right--;
            }else{
                now-=arr[left++];
            }
        }while(now<=b){
            if(left>0 && right<n){
                if(arr[i]-arr[left-1]>arr[right]-arr[i] && arr[right]-arr[i]<=b-now){
                    now+=arr[right]-arr[i]; right++;
                }else if(arr[i]-arr[left-1]<arr[right]-arr[i] && arr[i]-arr[left-1]<=b-now){
                    now+=arr[i]-arr[left-1]; left--;
                }else{
                    break;
                }
            }else if(left==0 && right<n){
                if(arr[right]-arr[i]<=b-now){
                    now+=arr[right]-arr[i]; right++;
                }else break;
            }else if(right==n && left!=0){
                if(arr[i]-arr[left-1]<=b-now){
                    now+=arr[i]-arr[left-1]; left--;
                }else break;
            }else break;
        }
        max1=max(max1,right-left);
    }
  return (int)max1;
}

Subtask #1
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 5772 KB Output isn't correct
2 Halted 0 ms 0 KB -