Codeforces 811 B Vladik and Complicated Book
来源:互联网 发布:软件产品设计流程 编辑:程序博客网 时间:2024/06/05 03:48
题目地址:http://codeforces.com/contest/811/problem/B
题意:Vladik有一本有n页的书,告诉你书的序列(并不是按大小顺序排的),他妈妈帮他整理m次书,每次都把一段序列(l-r)按从小到大的顺序排列,求在这种情况下Vladik能不能找到他要的那一页书(x)
题解:不能每次来排序,那样会超时,每次处理的时候去判断在这个区间内有多少个数比给定那个数的位置上的数小,如果是x-1的话就说明能找到输出“Yes”,否则输出“No”。
#include <iostream>#include <cstring>#include <string>#include <vector>#include <queue>#include <map>#include <algorithm>#define N 10010#define inf 0x3f3f3f3f#define LL long longusing namespace std;const LL mod = 1e9 + 7;int main() { cin.sync_with_stdio(false); int n, m; int a[N]; int l, r, x; while (cin >> n >> m) { for (int i = 1; i <= n; i++) { cin >> a[i]; } while (m--) { cin >> l >> r >> x; int cnt = 0; for (int i = l; i <= r; i++) { if (a[i] < a[x]) { cnt++; } } if(cnt==(x-l)){ cout << "Yes" << endl; } else { cout << "No" << endl; } } } return 0;}
阅读全文
1 0
- Codeforces 811B Vladik and Complicated Book
- Codeforces 811 B Vladik and Complicated Book
- Codeforces 811B Vladik and Complicated Book[主席树]
- CodeForce 811 B Vladik and Complicated Book
- B. Vladik and Complicated Book
- B. Vladik and Complicated Book
- Codeforces Round #416 (Div. 2) B. Vladik and Complicated Book
- Codeforces Round #416 (Div. 2) B. Vladik and Complicated Book
- Codeforces Round #416 (Div. 2) B. Vladik and Complicated Book
- codeforces——811B——Vladik and Complicated Book
- CodeForces 811B——Vladik and Complicated Book ——思维,模拟
- codeforces#416 div2- Vladik and Complicated Book
- Vladik and Complicated Book
- codeforce Vladik and Complicated Book
- #416 Div.2 B. Vladik and Complicated Book
- 主席树——Codeforces811B Vladik and Complicated Book
- codeforce811b Vladik and Complicated Book(都是不好好想题惹的祸)
- codeforces 811C Vladik and Memorable Trip
- NMAP的常用命令
- 《捉虫记——大容量Web应用性能测试与LoadRunner实战》读书笔记
- Centos7恢复Windows7引导
- Linux下的信号(一)
- 银行家算法简述解析
- Codeforces 811 B Vladik and Complicated Book
- java nullpointerexception
- C++中this指针的理解及用法
- 实现rip路由选择协议
- Spring Cloud 微服务间RPC使用 应用名称 替代 host:port
- 多线程-线程生命周期图解
- 线程--死锁
- LAMP之php与MariaDB
- 把数组排成最小的数