9 条题解

  • 4
    @ 2025-3-30 17:11:18

    火影手游回调秽土鼬 n=int(input()) x=list(map(int,input().split())) a=x[0] m=1 k=0 for j in range(1,n): if a<x[j]: m=m+1 a=x[j] if j==n-1: if k<=m: k=m else: a=x[j] if k<=m: k=m m=1 print(k)

    • 0
      @ 2024-8-18 17:56:36
      n=int(input())
      a=input()
      b=a.split()
      c=1
      d=[]
      for i in range (0,len(b)-1):
          if int(b[i])<int(b[i+1]):
              c+=1
          else:
              d.append(c)
              c=1
      d.append(c)
      print(max(d))
      
      • -1
        @ 2025-4-13 17:16:06
        n=int(input())
        m=list(map(int,input().split()))
        k=1
        s=0
        for i in range(len(m)-1):
            if m[i]<m[i+1]:
                k+=1
            elif m[i]>=m[i+1]:
                if k>s:
                    s=k
                k=1
        if k>s:
            s=k
        print(s)
        
        
        • -4
          @ 2024-8-5 22:42:41

          n=int(input())

          a=input()

          b=a.split()

          r=[];p=[];m=1;g=[]

          for i in b:

          r.append(int(i))
          

          for k in range(1,len(r)):

          d=r[k]-r[k-1]
          
          p.append(d)
          

          for t in range(len(p)):

          if p[t]>0:
          
              m+=1
          
          elif p[t]<=0 and p[t-1]>0:
          
              g.append(m)
          
              m=1
          
          elif p[t]<=0 and p[t-1]<=0:
          
              m=1
          

          g.append(m)

          print(max(g))

          • -5
            @ 2025-3-30 17:05:45

            n=int(input()) b=input().split() c=1 maxn=0 for i in range (0,len(b)-1): if int(b[i])<int(b[i+1]): c+=1 else: if c>maxn: maxn=c c=1 if c>maxn: maxn=c print(maxn)

            • -5
              @ 2025-3-30 16:53:10

              n=int(input()) m=list(map(int,input().split())) b=1 s=0 for i in range(len(m)-1): if m[i]<m[i+1]: b+=1 elif m[i]>=m[i+1]: if b>s: s=b b=1 if b>s: s=b print(s)

              • -7
                @ 2025-3-30 17:00:58

                c=1 x=1 a=int(input()) b=list(map(int,input().split())) for i in range(a-1): if b[i]<b[i+1]: x=x+1 if c<x: c=x else: c=c else: x=1 print(c)

                • -7
                  @ 2025-3-30 16:46:30
                  n=int(input())
                  m=list(map(int,input().split()))
                  b=1
                  s=0
                  for i in range(len(m)-1):
                      if m[i]<m[i+1]:
                          b+=1
                      elif m[i]>=m[i+1]:
                          if b>s:
                              s=b
                          b=1
                  if b>s:
                      s=b
                  print(s)
                  
                  
                  • -11
                    @ 2025-3-30 17:09:08

                    我魔方呢

                    • 1

                    信息

                    ID
                    741
                    时间
                    1000ms
                    内存
                    256MiB
                    难度
                    6
                    标签
                    (无)
                    递交数
                    2077
                    已通过
                    600
                    上传者