3401: [Usaco2009 Mar]Look Up 仰望

【3401: [Usaco2009 Mar]Look Up 仰望】的更多相关文章

BZOJ 3401: [Usaco2009 Mar]Look Up 仰望( 单调栈 )

n <= 105 , 其实是10 ^ 5 ....坑...我一开始写了个模拟结果就 RE 了.. 发现这个后写了个单调栈就 A 了... --------------------------------------------------------------------------------------------- #include<cstdio> #include<cstring> #include<algorithm> #include<iost…

3401: [Usaco2009 Mar]Look Up 仰望

3401: [Usaco2009 Mar]Look Up 仰望 Time Limit: 3 Sec Memory Limit: 128 MBSubmit: 136 Solved: 81[Submit][Status][Discuss] Description 约翰的N(1≤N≤105)头奶牛站成一排,奶牛i的身高是Hi(l≤Hi≤1,000,000)．现在,每只奶牛都在向左看齐．对于奶牛i,如果奶牛j满足i<j且Hi<Hj,我们可以说奶牛i可以仰望奶牛j．求出每只奶牛离她最近的仰望…

【BZOJ】3401: [Usaco2009 Mar]Look Up 仰望（单调栈）

http://www.lydsy.com/JudgeOnline/problem.php?id=3401 还能更裸一些吗.. 维护一个递减的单调栈 #include <cstdio> #include <cstring> #include <cmath> #include <string> #include <iostream> #include <algorithm> #include <queue> using nam…

BZOJ 3401: [Usaco2009 Mar]Look Up 仰望（离线+平衡树）

刷银组刷得好开心= = 离线按权值排序，从大到小插入二叉树，查找树中比这个数大的 CODE： #include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;#define maxn 100010struct node{ int ch[2],x,r;}t[maxn];int cmp(int x,int y){ if (t[x].x>y)…

bzoj 3401: [Usaco2009 Mar]Look Up 仰望【单调栈】

用单调递减的栈从后往前扫一遍即可 #include<iostream> #include<cstdio> using namespace std; const int N=1000005; int n,s[N],top,a[N],ans[N]; int read() { int r=0,f=1; char p=getchar(); while(p>'9'||p<'0') { if(p=='-') f=-1; p=getchar(); } while(p>='0'&…

BZOJ3401: [Usaco2009 Mar]Look Up 仰望

3401: [Usaco2009 Mar]Look Up 仰望 Time Limit: 3 Sec Memory Limit: 128 MBSubmit: 87 Solved: 58[Submit][Status] Description 约翰的N(1≤N≤105)头奶牛站成一排,奶牛i的身高是Hi(l≤Hi≤1,000,000)．现在,每只奶牛都在向左看齐．对于奶牛i,如果奶牛j满足i<j且Hi<Hj,我们可以说奶牛i可以仰望奶牛j．求出每只奶牛离她最近的仰望对象． Input…

P3401: [Usaco2009 Mar]Look Up 仰望

这道题第一眼还以为是树状数组,于是乎打着打着也是能过的 ; var n,i,j,maxx:longint; h,l:array[..] of longint; p:array[..] of longint; function lowbit(x:longint):longint; begin exit(x and (-x)); end; procedure insert(x,i:longint); var tem:longint; begin tem:=x; do begin p[tem]:=i;…