CodeForce 279C
来源:互联网 发布:visual studio java 编辑:程序博客网 时间:2024/05/21 10:28
好不容易AC了这题(果然是菜鸟-_-|||),,先记录下来再说。
先来看题目:
You've got an array, consisting of n integersa1, a2, ..., an. Also, you've gotm queries, the i-th query is described by two integersli, ri. Numbersli, ri define a subsegment of the original array, that is, the sequence of numbersali, ali + 1, ali + 2, ..., ari. For each query you should check whether the corresponding segment is a ladder.
A ladder is a sequence of integers b1, b2, ..., bk, such that it first doesn't decrease, then doesn't increase. In other words, there is such integerx(1 ≤ x ≤ k), that the following inequation fulfills:b1 ≤ b2 ≤ ... ≤ bx ≥ bx + 1 ≥ bx + 2... ≥ bk. Note that the non-decreasing and the non-increasing sequences are also considered ladders.
The first line contains two integers n andm(1 ≤ n, m ≤ 105) — the number of array elements and the number of queries. The second line contains the sequence of integersa1, a2, ..., an(1 ≤ ai ≤ 109), where numberai stands for thei-th array element.
The following m lines contain the description of the queries. Thei-th line contains the description of thei-th query, consisting of two integers li,ri(1 ≤ li ≤ ri ≤ n) — the boundaries of the subsegment of the initial array.
The numbers in the lines are separated by single spaces.
Print m lines, in the i-th line print word "Yes" (without the quotes), if the subsegment that corresponds to thei-th query is the ladder, or word "No" (without the quotes) otherwise.
8 61 2 1 3 3 5 2 11 32 32 48 81 45 8
YesYesNoYesNoYes
大体思路: 对用户给出的数组数据逐个分析,记录每个数据ai的两个卫星数据,即在ai左边且递减的数p的个数和在ai右边且递增的数的个数q,然后只要query的长度l - 1小于等于query起始位置的q + 结束位置的p即输出Yes,否则输出No。 用一个二维数组来记录p、q,简化计算。
解题代码如下:
#include <stdio.h>#include <vector>#include <utility>using namespace std;int map[100000][2];int array[100000];int main(){int n, m;scanf("%d%d", &n, &m);for (int i = 0; i < n; ++i)scanf("%d", &array[i]);vector<pair<int, int> > que(m);for (int i = 0; i < m; ++i)scanf("%d%d", &que[i].first, &que[i].second);for (int i = 0; i < n; ++i){if (i){if (array[i] <= array[i - 1]) map[i][0] = map[i - 1][0] + 1;else map[i][0] = 0;}}for (int i = n - 1; i >= 0; --i){if (i != n - 1){if (array[i] <= array[i + 1]) map[i][1] = map[i + 1][1] + 1;else map[i][1] = 0;}}for (int i = 0; i < m; ++i){int len = que[i].second - que[i].first;if (len <= map[que[i].first - 1][1] || len <= map[que[i].second - 1][0] ||len <= map[que[i].first - 1][1] + map[que[i].second - 1][0])printf("Yes\n");elseprintf("No\n");}return 0;}
- CodeForce 279C
- Codeforce # C. Average Score
- codeforce 237 C D
- Codeforce C. Barcode
- Codeforce 57C Array
- Codeforce 240C Practice
- Codeforce 332C
- codeforce 370C
- codeforce 400 C
- codeforce 6C
- codeforce 12C map
- codeforce 14C
- codeforce 18C
- codeforce 447C
- codeforce 20140808 C. Boredom
- codeforce 492 C D
- (288C)codeforce
- (385C)codeforce
- Java基础班第五天笔记
- java环境变量设置
- 水印的多分辨率嵌入算法
- ClockstRof Sky's Problem
- HIVE中的自定义函数(临时函数和永久函数)
- CodeForce 279C
- Spring基本知识
- Android屏幕保护KeyguardManager相关内容学习
- OpenCV(一) 打开一个摄像头
- Quick Sort
- Linux下配置权限受限制的SFTP用户教程
- window.dialogArguments的用法
- ios中在app中安装ipa的方法
- DAY02