제출 #28913

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
28913		ozaslan	쌀 창고 (IOI11_ricehub)	C++14	0 / 100	3 ms	5924 KiB

ricehub

#include "ricehub.h"
#include<bits/stdc++.h>

#include "ricehub.h"
#include <stdio.h>
#include <stdlib.h>

#define MAX_R  1000000

using namespace std;

/*static int R, L;
static long long B;
static int X[MAX_R];
static int solution;

inline
void my_assert(int e) {if (!e) abort();}

static void read_input()
{
  int i;
  my_assert(3==scanf("%d %d %lld",&R,&L,&B));
  for(i=0; i<R; i++)
    my_assert(1==scanf("%d",&X[i]));
  my_assert(1==scanf("%d",&solution));
}

int main()
{
    freopen("grader.in.1", "r", stdin);
  int ans;
  read_input();
  ans = besthub(R,L,X,B);
  if(ans==solution)
    printf("Correct.\n");
  else
    printf("Incorrect.  Returned %d instead of %d.\n",ans,solution);

  return 0;
}
*/
int besthub(int R, int L, int X[], long long B)
{
    int enIyi = 0, k = 2;

    long long sag = 0, toplam = 0;

    for(int sol = 0; sol <= sag; sol++) {
        int orta = (sol + sag) / 2;
        if(sol) toplam -= X[orta] - X[sol-1];
        k--;
        if(toplam > B) continue;

        for(  ; sag < R; sag++) {
          int orta = (sol + sag) % 2 ? (sol + sag) / 2 +1 : (sol + sag) / 2;

          toplam += X[sag] - X[orta];

          if(k > enIyi) enIyi = k;
          if(toplam > B) break;
          k++;
        }
    }

	return enIyi;
}

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