BZOJ3831: [Poi2014]Little Bird

 1 #include<cstdio>
 2 
 3 #include<cstdlib>
 4 
 5 #include<cmath>
 6 
 7 #include<cstring>
 8 
 9 #include<algorithm>
10 
11 #include<iostream>
12 
13 #include<vector>
14 
15 #include<map>
16 
17 #include<set>
18 
19 #include<queue>
20 
21 #include<string>
22 
23 #define inf 1000000000
24 
25 #define maxn 1000000+5
26 
27 #define maxm 200000+5
28 
29 #define eps 1e-10
30 
31 #define ll long long
32 
33 #define pa pair<int,int>
34 
35 #define for0(i,n) for(int i=0;i<=(n);i++)
36 
37 #define for1(i,n) for(int i=1;i<=(n);i++)
38 
39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
40 
41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
42 
43 #define for4(i,x) for(int i=head[x],y=e[i].go;i;i=e[i].next,y=e[i].go)
44 
45 #define for5(n,m) for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)
46 
47 #define mod 1000000007
48 
49 using namespace std;
50 
51 inline int read()
52 
53 {
54 
55     int x=0,f=1;char ch=getchar();
56 
57     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
58 
59     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
60 
61     return x*f;
62 
63 }
64 int n,m,k,a[maxn],f[maxn],q[maxn];
65 
66 int main()
67 
68 {
69 
70     freopen("input.txt","r",stdin);
71 
72     freopen("output.txt","w",stdout);
73 
74     n=read();
75     for1(i,n)a[i]=read();
76     m=read();
77     while(m--)
78     {
79         k=read();
80         int l=1,r=1;q[1]=1;f[1]=0;
81         for2(i,2,n)
82         {
83             while(l<r&&i-q[l]>k)l++;
84             f[i]=f[q[l]]+(int)(a[q[l]]<=a[i]);
85             while(l<=r&&(f[i]<f[q[r]]||(f[i]==f[q[r]]&&a[i]>a[q[r]])))r--;
86             q[++r]=i;
87         }
88         printf("%d\n",f[n]);
89     }
90 
91     return 0;
92 
93 }