hdu5806 NanoApe Loves Sequence Ⅱ 前缀和 + 二分
来源:互联网 发布:宏业斯维尔软件 编辑:程序博客网 时间:2024/06/07 05:35
NanoApe Loves Sequence Ⅱ
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 662 Accepted Submission(s): 315
Problem Description
NanoApe, the Retired Dog, has returned back to prepare for for the National Higher Education Entrance Examination!
In math class, NanoApe picked up sequences once again. He wrote down a sequence withn numbers and a number m on the paper.
Now he wants to know the number of continous subsequences of the sequence in such a manner that thek -th largest number in the subsequence is no less than m .
Note : The length of the subsequence must be no less thank .
In math class, NanoApe picked up sequences once again. He wrote down a sequence with
Now he wants to know the number of continous subsequences of the sequence in such a manner that the
Note : The length of the subsequence must be no less than
Input
The first line of the input contains an integer T , denoting the number of test cases.
In each test case, the first line of the input contains three integersn,m,k .
The second line of the input containsn integers A1,A2,...,An , denoting the elements of the sequence.
1≤T≤10, 2≤n≤200000, 1≤k≤n/2, 1≤m,Ai≤109
In each test case, the first line of the input contains three integers
The second line of the input contains
Output
For each test case, print a line with one integer, denoting the answer.
Sample Input
17 4 24 2 7 7 6 5 1
Sample Output
18
Source
BestCoder Round #86
#include <cstdio>#include <iostream>#include <cstring>#include <cmath>#include <algorithm>using namespace std;typedef long long ll;ll n, m, k, a[200005], sum[200005], cnt, ans;int main(){ll T;cin >> T;while (T--) {scanf("%I64d%I64d%I64d", &n, &m, &k);sum[0] = a[0] = 0;//算到i为止(包括i)有多少个大于等于m的数//可知sum是不减的,可以用二分for (ll i = 1; i <= n; i++) {scanf("%I64d", &a[i]);sum[i] = (a[i] >= m ? sum[i - 1] + 1 : sum[i - 1]);}ans = 0;for (ll i = 1; i <= n; i++) {//core-debug l = i + k - 1 not l = i + 1 when k == 1ll l = i + k - 1, r = n, mid;while (l <= r) {mid = (l + r) / 2;ll t = sum[mid] - sum[i - 1];if (t >= k) {r = mid - 1;}else {l = mid + 1;}}if (l <= n) //二分找不到的情况,即所有都小ans += (n - l + 1);}printf("%I64d\n", ans);}return 0;}
0 0
- hdu5806 NanoApe Loves Sequence Ⅱ 前缀和 + 二分
- HDU5806 NanoApe Loves Sequence Ⅱ
- HDU5806 NanoApe Loves Sequence Ⅱ BestCoder Round #86 two-pointer
- HDU5806 NanoApe Loves Sequence Ⅱ(尺取法\two pointers)
- HDU5806 NanoApe Loves Sequence Ⅱ【尺取法+乘法原理】
- HDU 5806 NanoApe Loves Sequence Ⅱ(前缀和)
- hdu 5806 NanoApe Loves Sequence Ⅱ 前缀和+尺取法
- NanoApe Loves Sequence Ⅱ
- NanoApe Loves Sequence Ⅱ
- HUD-5806 NanoApe Loves Sequence Ⅱ(二分)
- hdu 5806 NanoApe Loves Sequence Ⅱ(二分或尺取法)
- hdoj5805 NanoApe Loves Sequence && hdoj 5806 NanoApe Loves Sequence Ⅱ
- hdu NanoApe Loves Sequence Ⅱ
- hdu 5086 NanoApe Loves Sequence 【二分查找】
- HDOJ 5806 NanoApe Loves Sequence Ⅱ
- hdu 5806 NanoApe Loves Sequence Ⅱ
- HDU 5806 NanoApe Loves Sequence Ⅱ
- hdu 5806 NanoApe Loves Sequence Ⅱ
- 浅析数据结构与算法12--无向图相关算法基础
- Java transient关键字使用
- [安卓自定义控件]BadgeView源码解析
- 161.In your database instance, the user sessions are connected to the database server from the remot
- ex3.py
- hdu5806 NanoApe Loves Sequence Ⅱ 前缀和 + 二分
- The file “XXX.app” couldn’t be opened because you don’t have permission to view it.
- 关于SVM支持向量机的学习
- 动态规划-满减优惠
- zcmu1461
- ex4.py
- java synchronized
- Android开发人员不得不收集的代码
- poj 1936 All in All