Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 37911    Accepted Submission(s): 18065
#include<iostream> #include<cstdlib> #include<cstdio> #include<cstring> #include<string> #include<algorithm> #include<cmath> using namespace std; int a[100005],d[100005]; int main() { int n; scanf("%d",&n); while(n!=0) { int l,r; memset(a,0,sizeof(a));memset(d,0,sizeof(d));//a[n]记录每个元素被涂色的次数 for(int i=1;i<=n;++i){ scanf("%d%d",&l,&r); d[l]++;d[r+1]--; } for(int i=1;i<=n;++i){ d[i]+=d[i-1];//差分数组前缀和 if(i!=n)printf("%d ",d[i]);//a[n]后不能有空格 } printf("%d",d[n]); cout<<endl; scanf("%d",&n); } return 0; }
01:08:39
2020-02-16
原文:https://www.cnblogs.com/m2364532/p/12315560.html