2019/9/6 招引网科算法笔试题

#第二题求矩阵最大面积和
import collections
n=int(input().strip())
nums=list(map(int,input().strip().split()))# 6 5 4 0 3 7 7----35
counter=dict(collections.Counter(nums))
counter=sorted(counter.items(),key=lambda s:int(s[0]),reverse=True)
#print(counter)
ll=[]
mm=[]
temp=0
for value,num in counter:
    if value>0:
        if num>=2:
            while num>=2:
                ll.append(value)
                if len(ll)==2:
                    mm.append(ll[0]*ll[1])
                    ll=[]
                num-=2
        if num==1:
            if temp==0:
                temp=value
            elif temp==value+1:
                ll.append(value)
                temp=0
        if len(ll)==2:
            mm.append(ll[0]*ll[1])
            ll=[]
print(sum(mm))
#第三题拿面包
n,k=map(int,input().strip().split())
nums=list(map(int,input().strip().split()))
j=0
pp=[]
for i in range(n):
    if 8>=nums[j]:
        pp.append(nums[j])
        j+=1
        if j>=len(nums):
            nums.append(0)
    else:
        temp=nums[j]-8
        pp.append(8)
        j+=1
        if j>=len(nums):
            nums.append(0)
        a[j]+=temp
        
    if sum(pp)>=k:
        print(i+1)
if sum(pp)<k:
    print(-1)