Codeforces-797E-Array Queries(dp)
2017-04-21 20:46
387 查看
题目链接:Codeforces-797E-Array Queries
对于 k>n√ 的询问,直接暴力来算,复杂度为 O(n√)
对于 k≤n√的询问,O(n1.5)预处理出答案dp[p][k]。
对于 k>n√ 的询问,直接暴力来算,复杂度为 O(n√)
对于 k≤n√的询问,O(n1.5)预处理出答案dp[p][k]。
#include<bits/stdc++.h> using namespace std; const int maxn=1e5+7; int dp[maxn][350]; int a[maxn]; int main() { fb53 int n; scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); int h=sqrt(n)+1; for(int i=n;i>=1;i--) for(int j=0;j<h;j++) { if(a[i]+i+j>n) dp[i][j]=1; else dp[i][j]=dp[a[i]+i+j][j]+1; } int q; scanf("%d",&q); while(q--) { int p,k; scanf("%d%d",&p,&k); if(k<h) printf("%d\n",dp[p][k]); else { int ans=0; while(p<=n) { p+=a[p]+k; ans++; } printf("%d\n",ans); } } }
相关文章推荐
- 【codeforces 797E】Array Queries
- AC日记——Array Queries codeforces 797e
- Codeforces 830D [DP]
- CodeForces 540D Bad Luck Island (概率dp)
- Codeforces 55D Beautiful numbers 数位dp
- [DP] Codeforces 403D #236 (Div. 1) D. Beautiful Pairs of Numbers
- CodeForces 626F Group Projects(dp)
- [矩阵快速幂加速DP] Codeforces 717D Bubble Cup 9 - Finals D. Dexterina’s Lab
- Codeforces 835F Round #427 Div2F :树形DP
- Codeforces 77C 树形DP
- 2016 北邮暑期训练3-D题(Codeforces 698A Vacations)DP,水题
- Codeforces 811C Vladik and Memorable Trip[dp]
- Codeforces 418d Big Problems for Organizers [树形dp][倍增lca]
- Codeforces #277.5 (Div. 2) B. BerSU Ball(DP:LCS)
- CodeForces 540D Bad Luck Island (DP)
- CodeForces 54C-First Digit Law(数位,概率dp)
- 【Codeforces 743D】 Chloe and pleasant prizes【树形dp】
- codeforces 490F Treeland Tour(dp)
- codeforces 55D. Beautiful numbers 数位dp
- CodeForces 711C Coloring Trees(DP)