目录:
题目:
分析:
作者为了迎合第一题的难度,所以将数据大小限制得十分友善,故此,我们可以暴力模拟直接AC(离线算法),也可以使用前缀和+二分(在线算法)
代码(离线):
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#define LL long long
using namespace std;
inline LL read() {
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
int x[50001];
struct node{
int a,b;
}y[50001];
bool cmd(node w,node v)
{
return w.a<v.a;
}
int ans[50001];
int main()
{
freopen("mnotes.in","r",stdin);
freopen("mnotes.out","w",stdout);
int n=read(),q=read();
int music=0;
for(int i=1;i<=n;i++) x[i]=read();
for(int i=1;i<=q;i++)
y[i].a=read(),y[i].b=i;
sort(y+1,y+1+q,cmd);
int k=1;
for(int i=1;i<=n;i++)
{
music+=x[i]-1;//music用来确定每个音节的范围
while(y[k].a<=music&&k<=q)
{
ans[y[k].b]=i;
k++;
}
music++;
}
for(int i=1;i<=q;i++) printf("%d\n",ans[i]);
fclose(stdin);
fclose(stdout);
return 0;
}
代码(在线):
#include <cstdio>
#include <cctype>
#include <algorithm>
#define us unsigned short
using namespace std;
struct rec{int x; us y;}b[50005]; us n,q,t=1,a[50005],ans[50005]; int tosic=-1;
int in(){
int ans=0; char c=getchar();
while (!isdigit(c)) c=getchar();
while (isdigit(c)) ans=ans*10+c-48,c=getchar();
return ans;
}
bool cmp(rec x,rec y){return x.x<y.x;}
int main(){
freopen("mnotes.in","r",stdin);
freopen("mnotes.out","w",stdout);
n=in(); q=in();
for (int i=1;i<=n;i++) a[i]=in();
for (int i=1;i<=q;i++) b[i]=(rec){in(),i};
stable_sort(b+1,b+1+q,cmp);
for (int i=1;i<=n;i++){
tosic+=a[i];
while (b[t].x<=tosic&&t<=q) ans[b[t++].y]=i;
}
for (int i=1;i<=q;i++) printf("%d\n",ans[i]);
return 0;
}