Many Constraint Programming models use integer cost variables ag- gregated in an objective criterion. In this context, some constraints involving exclusively cost variables are often imposed. Such constraints are complemen- tary to the objective function. They characterize the solutions which are accept- able in practice. This paper deals with the case where the set of costs is a se- quence, in which high values should be concentrated in a few number of areas. Representing such a property through an search heuristic may be complex and overall not precise enough. To solve this issue, we introduce a new constraint, FOCUS(X,yc,len, k), where X is a sequence of n integer variables, yc an in- teger variable, and len and k are two integers. To satisfy FOCUS, the minimum number of distinct sub-sequences of consecutive variables in X, of length at most len and that involve exclusively values strictly greater than k, should be less than or equal to yc. We present two examples of problems involving FOCUS. We pro- pose a complete filtering algorithm in O(n) time complexity.