• [1627] Alex’s Game(II)

  • 时间限制: 2000 ms　内存限制: 65535 K
  • 问题描述

  • Alex likes to play with one and zero as you know .

    Today he gets a sequence which contains n(n<=1e5) integers.Each integer is no nore than 100.now he wants to know what’s the minimun contigous subsequence that their puduct contain no less than k(k<=1e5) zeros in the tail.

  • 输入
  • First are two integers n and k.
    Next contains n lines ,every line contains n integers.
    All integers are bigger than 0.
  • 输出
  • For each case output the answer if you can find it.
    Else just output “haha”
  • 样例输入
  • 5 1
2 10 2 5 1
5 3
2 10 2 5 1
  • 样例输出
  • 1
haha
  • 提示
  • 无
  • 来源
  • Tisuama@WUST
  • 操作

显示春菜