Golfed, I get you down to 140
, assuming the inputs are ordered smallest to largest. Interestingly enough, if you have the defined-or patch, I get down to 122.
If the inputs aren't ordered, add 13 characters to both solutions.
Without //= patch:
@x=@_;my%c;$e=sub{my$v=pop;exists$c{$v}?$c{$v}:$c{$v}=$v<0?0:$v==0||gr
+ep&$e($v-$_),@x};$t=$s=0;{&$e(++$t)?$t-$s>=$x[0]&&last:($s=$t);redo}$
+s
With //= patch:
@x=@_;my%c;$e=sub{my$v=pop;$c{$v}//=$v<0?0:$v==0||grep&$e($v-$_),@x};$
+t=$s=0;{&$e(++$t)?$t-$s>=$x[0]&&last:($s=$t);redo}$s
|
Update: Actually, the inputs don't have to be ordered. It just means that the algorithm will take a little longer, but it will get the right results. Also, drop a character by reordering the assignment to $c{$v}. The //= patched version looks like:
@x=@_;my%c;$e=sub{my$v=pop;$c{$v}//=$v==0||$v>0&&grep&$e($v-$_),@x};$t
+=$s=0;{&$e(++$t)?$t-$s>=$x[0]&&last:($s=$t);redo}$s
|
Update: Rewriting the redo-loop as a C-style for-loop drops to 111 characters for the //= patched version.
@x=@_;my%c;$e=sub{my$v=pop;$c{$v}//=!$v||$v>0&&grep&$e($v-$_),@x};for(
+$t=$s=0;$t-$s<$x[0];&$e(++$t)or$s=$t){}$s
|
Being right, does not endow the right to be rude; politeness costs nothing.
Being unknowing, is not the same as being stupid.
Expressing a contrary opinion, whether to the individual or the group, is more often a sign of deeper thought than of cantankerous belligerence.
Do not mistake your goals as the only goals; your opinion as the only opinion; your confidence as correctness. Saying you know better is not the same as explaining you know better.
