Bzoj3412: [usaco2009 DEC] Music notes music score

3412: [usac2009 DEC] Music notes score time limit: 3 sec memory limit: 128 MB
Submit: 35 solved: 30
[Submit] [Status] Description Input

Row 1st: two integers, N, Q.

Rows 2nd to n + 1: line I + L has only one integer bi.

Row n + 2 to N + q + I: Row N + I + L has only one integer ti.

 

Output

Rows 1st to Q: Which scale is the cow hitting during the time of the word question for each query?

Sample input3 5
2
1
3
2
3
4
0
1 sample output2
3
3
1
1 hint Source

Silver

Question:

Binary value. We are c ++ and can directly lower_bound

T of water, such a t_t

Code:

 1 #include<cstdio> 2 #include<cstdlib> 3 #include<cmath> 4 #include<cstring> 5 #include<algorithm> 6 #include<iostream> 7 #include<vector> 8 #include<map> 9 #include<set>10 #include<queue>11 #include<string>12 #define inf 100000000013 #define maxn 50000+10014 #define maxm 500+10015 #define eps 1e-1016 #define ll long long17 #define pa pair<int,int>18 #define for0(i,n) for(int i=0;i<=(n);i++)19 #define for1(i,n) for(int i=1;i<=(n);i++)20 #define for2(i,x,y) for(int i=(x);i<=(y);i++)21 #define for3(i,x,y) for(int i=(x);i>=(y);i--)22 #define mod 100000000723 using namespace std;24 inline int read()25 {26     int x=0,f=1;char ch=getchar();27     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}28     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}29     return x*f;30 }31 int n,m,x,a[maxn];32 int main()33 {34     freopen("input.txt","r",stdin);35     freopen("output.txt","w",stdout);36     n=read();m=read();a[0]=-1;37     for1(i,n)x=read(),a[i]=a[i-1]+x;38     while(m--)printf("%d\n",lower_bound(a+1,a+n+1,read())-a);39     return 0;40 }

View code

 

 

Bzoj3412: [usaco2009 DEC] Music notes music score