NLP-D46-nlp比赛D15

—0557昨天2点睡的（弄完12点啦，有点想熬夜hhh）早上5点多醒了，就醒了。

刚刚改了改程序，现在跑着；
自己去看论文啦！！！

2-不重要-已读
0-重要、需精读
1-重要、已读完
3-一般，未读完
4-一般，已读

-0为知识图谱本身，-1为网安

-----0748经过训练，读论文的时间观已经好很多了，但是总结需要流程化，要不然太慢了！！！
吃早饭！

https://blog.csdn.net/qq_33837704/article/details/114142390

—0955
开始刷一下题~

n,m,q = map(int,input().split())

a = [[0]*(m+2) for _ in range(n+2)]
b = [[0]*(m+2) for _ in range(n+2)]

for i in range(1,1+n):
    a[i][1:] = list(map(int,input().split()))

def add(x1,y1,x2,y2,c):
    b[x1][y1]+=c
    b[x2+1][y1]-=c
    b[x1][y2+1]-=c
    b[x2+1][y2+1]+=c
    
for i in range(1,1+n):
    for j in range(1,1+m):
        add(i,j,i,j,a[i][j])

for _ in range(q):
    x1,y1,x2,y2,c = map(int,input().split())
    add(x1,y1,x2,y2,c)

for i in range(1,1+n):
    for j in range(1,1+m):
        b[i][j] += b[i][j-1]+b[i-1][j]-b[i-1][j-1]
        print(b[i][j],end = ' ')
    print()
    

别忘了改变j的值

n = int(input())
a = list(map(int,input().split()))

j = 0
S = [0]*100010
res = 0
for i in range(n):
    S[a[i]]+=1
    while j1:
        S[a[j]]-=1
        j+=1
    res = max(res, i-j+1)

print(res)

n,m = map(int,input().split())

a = list(map(int,input().split()))
b  = list(map(int,input().split()))

i,j = 0,0

while in-1:
    print('Yes')
else:
    print('No')

n = int(input())
a = list(map(int,input().split()))
def lowbit(x):
    return x&(-x)
def nums_one(x):
    i = 0 
    while lowbit(x):
        i+=1
        x-=lowbit(x)
    return i
for x in a:
    print(nums_one(x), end=' ')