bzoj4397[Usaco2015 dec]Breed Counting 前缀和
来源:互联网 发布:阿里云io优化实例 编辑:程序博客网 时间:2024/06/10 15:29
Description
Farmer John's N cows, conveniently numbered 1…N, are all standing in a row (they seem to do so often that it now takes very little prompting from Farmer John to line them up). Each cow has a breed ID: 1 for Holsteins, 2 for Guernseys, and 3 for Jerseys. Farmer John would like your help counting the number of cows of each breed that lie within certain intervals of the ordering.
给定一个长度为N的序列,每个位置上的数只可能是1,2,3中的一种。
有Q次询问,每次给定两个数a,b,请分别输出区间[a,b]里数字1,2,3的个数。
Input
The first line of input contains NN and QQ (1≤N≤100,000 1≤Q≤100,000).
The next NN lines contain an integer that is either 1, 2, or 3, giving the breed ID of a single cow in the ordering.
The next QQ lines describe a query in the form of two integers a,b (a≤b).
Output
For each of the QQ queries (a,b), print a line containing three numbers: the number of cows numbered a…b that are Holsteins (breed 1), Guernseys (breed 2), and Jerseys (breed 3).
Sample Input
2
1
1
3
2
1
1 6
3 3
2 4
Sample Output
1 0 0
2 0 1
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#define maxn 100010using namespace std;int n,q,a[maxn],b[maxn],c[maxn];int main(){ scanf("%d%d",&n,&q); for(int i=1;i<=n;i++) { int x; scanf("%d",&x); a[i]=a[i-1],b[i]=b[i-1],c[i]=c[i-1]; if(x==1) a[i]++; if(x==2) b[i]++; if(x==3) c[i]++; } while(q--) { int x,y; scanf("%d%d",&x,&y); printf("%d %d %d\n",a[y]-a[x-1],b[y]-b[x-1],c[y]-c[x-1]); }}
- bzoj4397[Usaco2015 dec]Breed Counting 前缀和
- bzoj4397【Usaco2015 Dec】Breed Counting
- bzoj4397: [Usaco2015 dec]Breed Counting
- 【BZOJ4397】[Usaco2015 dec]Breed Counting【前缀和】【或莫队】【或线段树】【或可持久化线段树】
- bzoj 4397: [Usaco2015 dec]Breed Counting 前缀和/线段树
- [BZOJ4397]Breed Counting-前缀和乱搞
- BZOJ 4397: [Usaco2015 dec]Breed Counting|暴力
- bzoj 4397: [Usaco2015 dec]Breed Counting 乱搞
- 【Usaco2015 dec 】Counting Haybales
- bzoj4392【Usaco2015 Dec】Counting Haybales
- Breed Counting(水?)
- BZOJ 4397 Breed Counting
- bzoj4394【Usaco2015 Dec】Bessie
- [Usaco2015 dec]Max Flow
- bzoj4393【Usaco2015 Dec】Fruit Feast
- bzoj4390【Usaco2015 Dec】Max Flow
- 【bzoj4390】[Usaco2015 dec]Max Flow
- bzoj4390: [Usaco2015 dec]Max Flow
- wordpress保护wp-login.php和wp-cron.php
- RecyclerView各种功能.上下拉,间隔线,多条目等
- ios-Swift中如何保存图片到本地
- 虚析构函数
- HTML5 特点及变化
- bzoj4397[Usaco2015 dec]Breed Counting 前缀和
- Python与sql server数据库交互(学习日记)
- 阿里云申请SSL证书以及配置Tomcat为Https请求
- [NOIP2017模拟]Array
- BeanDefinitionStoreException: Failed to read candidate component class: file 问题的解决
- 计算机中cpu的速度和硬盘的容量
- Mybatis+MySql中字段名为保留字(关键字)的情况
- centos编译时报错:error: curses.h: No such file or directory
- MapReduce作业执行流程