We are given hours, a list of the number of hours worked per day for a given employee.
A day is considered to be a tiring day if and only if the number of hours worked is (strictly) greater than 8.
A well-performing interval is an interval of days for which the number of tiring days is strictly larger than the number of non-tiring days.
Return the length of the longest well-performing interval.
 
Example 1:
Input: hours = [9,9,6,0,6,6,9]
Output: 3
Explanation: The longest well-performing interval is [9,9,6].

 
Constraints:

1 <= hours.length <= 10000
0 <= hours[i] <= 16

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n    def findslavedays(self,hours):\n        a=0\n        b=0\n        slave=0\n        nonslave=0\n        slavedays=0\n        while b<len(hours):\n          #  print(a,b,slave,nonslave,slavedays)\n            if slave>nonslave:\n                slavedays=max(slavedays,b-a+slave-nonslave-1)\n            if a==b:\n                if hours[a]<=8:\n                    nonslave+=1\n                else:\n                    slave+=1\n                b+=1\n                continue\n            if slave<nonslave:\n                if hours[a]<=8:\n                    nonslave-=1\n                else:\n                    slave-=1\n                a+=1\n            elif slave>=nonslave:\n                if hours[b]<=8:\n                    nonslave+=1\n                else:\n                    slave+=1\n                b+=1\n            \n            if slave>nonslave:\n                slavedays=max(slavedays,b-a+slave-nonslave-1)\n        print(a,b)\n        while a>0:\n            a-=1\n            if hours[a]<=8:\n                nonslave+=1\n            else:\n                slave+=1\n            if slave>nonslave:\n                slavedays=max(slavedays,b-a+slave-nonslave-1)\n        if slave>nonslave:\n                slavedays=max(slavedays,b-a+slave-nonslave-1)        \n        return slavedays\n    def longestWPI(self, hours: List[int]) -> int:\n        isslave=[-1]*len(hours)\n        sumslave=0\n        for i in range(len(isslave)):\n            if hours[i]>8:\n                isslave[i]=1\n        dic={}\n        maxslavedays=0\n        print(isslave)\n        for i in range(len(isslave)):\n            \n            sumslave=isslave[i]+sumslave\n          #  print(sumslave)\n            if sumslave>0:\n                maxslavedays=max(maxslavedays,i+1)\n\n            if sumslave not in dic:\n                dic[sumslave]=i\n            if sumslave-1 in dic:\n                \n                maxslavedays=max(maxslavedays,i-dic[sumslave-1])\n        print(dic)\n        return maxslavedays\n    \n        print(isslave,sumslave)\n        a=-1\n        b=0\n        dic={}\n        dic[0]=-1\n        for i in range(len(isslave)):\n            \n            if sumslave[i]>0:\n                b=i\n                maxslavedays=max(maxslavedays,b-a)\n            if sumslave[i]<=0:\n                a=i\n        return maxslavedays\n            \n        #for i in range(1,len(isslave)):\n            \n        return 0\n        slavelength1=self.findslavedays(hours)\n        slavelength2=self.findslavedays(hours[::-1])\n        return max(slavelength1,slavelength2)'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'longestWPI'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6313