sclass RollingMaximum {
  int windowSize = 100, i;
  L<Entry> queue = new CircularArrayList; //linkedList();

  sclass Entry {
    int removeIndex;
    double value;
  
    *() {}
    *(int *removeIndex, double *value) {}
  }
  
  *() {}
  *(int *windowSize) {}
    
  double addAndGet(double val) {
    while (nempty(queue) && i >= first(queue).removeIndex)
      popFirst(queue);

    while (nempty(queue) && last(queue).value <= val)
      popLast(queue);

    queue.add(new Entry(i + windowSize, val));
    i++;
    ret first(queue).value;
  }
}