cf#419 Karen and Coffee 前缀和
来源:互联网 发布:迅龙数据恢复下载安装 编辑:程序博客网 时间:2024/05/17 23:08
前缀和就是对于每一个区间的元素个数做一个总结
再dp一下求出重复值,重复值大于那个次数就可以
To stay woke and attentive during classes, Karen needs some coffee!
Karen, a coffee aficionado, wants to know the optimal temperature for brewing the perfect cup of coffee. Indeed, she has spent some time reading several recipe books, including the universally acclaimed "The Art of the Covfefe".
She knows n coffee recipes. The i-th recipe suggests that coffee should be brewed between li and ri degrees, inclusive, to achieve the optimal taste.
Karen thinks that a temperature is admissible if at leastk recipes recommend it.
Karen has a rather fickle mind, and so she asks q questions. In each question, given that she only wants to prepare coffee with a temperature betweena and b, inclusive, can you tell her how many admissible integer temperatures fall within the range?
The first line of input contains three integers, n,k (1 ≤ k ≤ n ≤ 200000), andq (1 ≤ q ≤ 200000), the number of recipes, the minimum number of recipes a certain temperature must be recommended by to be admissible, and the number of questions Karen has, respectively.
The next n lines describe the recipes. Specifically, thei-th line among these contains two integersli andri (1 ≤ li ≤ ri ≤ 200000), describing that thei-th recipe suggests that the coffee be brewed betweenli andri degrees, inclusive.
The next q lines describe the questions. Each of these lines containsa and b, (1 ≤ a ≤ b ≤ 200000), describing that she wants to know the number of admissible integer temperatures betweena and b degrees, inclusive.
For each question, output a single integer on a line by itself, the number of admissible integer temperatures betweena and b degrees, inclusive.
3 2 491 9492 9797 9992 9493 9795 9690 100
3304
2 1 11 1200000 20000090 100
0#include<stdio.h>#include<math.h>#include<stdlib.h>#include<string.h>using namespace std;int main(){ int n,k,q; while(~scanf("%d %d %d",&n,&k,&q)) { int l,r; int num[200005]; memset(num,0,sizeof(num)); for(int i=0;i<n;i++) { scanf("%d %d",&l,&r); num[l]++; num[r+1]--; } int c[200005]; memset(c,0,sizeof(c)); for(int i=1;i<=200000;i++) { num[i]+=num[i-1]; c[i]+=c[i-1]+(num[i]>=k); } for(int i=0;i<q;i++) { scanf("%d %d",&r,&l); printf("%d\n",c[l]-c[r-1]); } } return 0;}
- cf#419 Karen and Coffee 前缀和
- 前缀和--cf816b karen and coffee
- Karen and Coffee(前缀和,大量查询)
- Codeforces 816B Karen and Coffee(前缀和)
- codeforces 816-B. Karen and Coffee(前缀和+思维)
- [前缀和] Codeforces Round #419 (Div. 2)B. Karen and Coffee
- Codeforces Round #419 (Div. 2) B. Karen and Coffee【前缀和求区间覆盖次数】
- Codeforces#419 Karen and Coffee
- CF816B-Karen and Coffee
- Karen and Coffee codeforces
- CF816B-Karen and Coffee
- Codeforces816B Karen and Coffee
- Karen and Coffee
- CF419 div2B. Karen and Coffee
- CodeForces B. Karen and Coffee
- Karen and Coffee 816B
- Codeforces Round #419 (Div. 2)Karen and Coffee
- Codeforces Round #419 (Div. 2) B. Karen and Coffee
- Ubuntu编译安装llvm-clang
- MySQL数据库中的存储引擎
- 搭建frp实现树莓派内网穿透
- centos 6.x下安装nodejs
- codeforces 816A
- cf#419 Karen and Coffee 前缀和
- linux与window文件目录共享——samba配置及在windows映射
- 微型技术博客之静态类
- 最小费用最大流模版
- 用python爬取百科糗事的小项目
- Lua 数学库
- codeforces 2016-2017 NTUWFTSC J Zero Game
- Hibernate中对象的三种状态及相互转化
- Nginx WEB 安装