Valhalla Siege CodeForces - 975C(思维)

CodeForces - 975C

Ivar the Boneless is a great leader. He is trying to capture Kattegat from Lagertha. The war has begun and wave after wave Ivar's warriors are falling in battle.

Ivar has n

warriors, he places them on a straight line in front of the main gate, in a way that the i-th warrior stands right after (i−1)

-th warrior. The first warrior leads the attack.

Each attacker can take up to ai

arrows before he falls to the ground, where ai is the i

-th warrior's strength.

Lagertha orders her warriors to shoot ki

arrows during the i-th minute, the arrows one by one hit the first still standing warrior. After all Ivar's warriors fall and all the currently flying arrows fly by, Thor smashes his hammer and all Ivar's warriors get their previous strengths back and stand up to fight again. In other words, if all warriors die in minute t, they will all be standing to fight at the end of minute t

.

The battle will last for q

minutes, after each minute you should tell Ivar what is the number of his standing warriors.

Input

The first line contains two integers n

and q ( 1≤n,q≤200000

) — the number of warriors and the number of minutes in the battle.

The second line contains n

integers a1,a2,…,an ( 1≤ai≤109

) that represent the warriors' strengths.

The third line contains q

integers k1,k2,…,kq ( 1≤ki≤1014), the i-th of them represents Lagertha's order at the i-th minute: ki

arrows will attack the warriors.

Output

Output q

lines, the i-th of them is the number of standing warriors after the i

-th minute.

Examples

Input

5 5
1 2 1 2 1
3 10 1 1 1

Output

3
5
4
4
3

Input

4 4
1 2 3 4
9 1 10 6

Output

1
4
4
1

Note

In the first example:

• after the 1-st minute, the 1-st and 2-nd warriors die.
• after the 2-nd minute all warriors die (and all arrows left over are wasted), then they will be revived thus answer is 5 — all warriors are alive.
• after the 3-rd minute, the 1-st warrior dies.
• after the 4-th minute, the 2-nd warrior takes a hit and his strength decreases by 1.
• after the 5-th minute, the 2-nd warrior dies.

题目意思是你有n个士兵每个士兵都有一个生命值 有k轮攻击 每次攻击为k  如果有一次全部士兵都死了 那就全部重新复活而且这轮的攻击就会被忽略 问还剩下多少个士兵

题解:  emmm前缀和 +二分  其中主要的思路在于 res+=x 这个算是解题想法吧

代码:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2*1e5+100;
ll a[maxn],c[maxn],sum[maxn];
int main()
{
	int n,q;
	scanf("%d%d",&n,&q);
	for(int i = 1;i<=n;i++)
	{ 
		scanf("%lld",&a[i]);
		sum[i] = sum[i-1]+a[i];//这个表示的是前缀和 
	}
	int beginn = 1;//表示现在活着的人在beginn这里 
	ll res = 0;
	while(q--)
	{
		ll x;
		scanf("%lld",&x);
		res+=x;
	//	printf("%d\n",res);
		int pos = upper_bound(sum+beginn,sum+n+1,res)-sum;//表示的是位置表示的找到第一个大于它的数字表示这个数字还是活着的 
//		printf("1*---------------    pos ===%d     beginn ==%d\n",pos,beginn);
		if(pos == n+1)//表示到达末尾的了 全部士兵都被杀了所以全部士兵重新复活 
		{
			printf("%d\n",n);
			beginn = 1; 
			res = 0;
		}else 
		{
			beginn = pos; 
			printf("%d\n",n-pos+1);
				
		} 
	}
	return 0;
}