Codeforces-797E-Array Queries(dp)
来源:互联网 发布:切换ip软件 编辑:程序博客网 时间:2024/06/05 11:04
题目链接:Codeforces-797E-Array Queries
对于
对于
#include<bits/stdc++.h>using namespace std;const int maxn=1e5+7;int dp[maxn][350];int a[maxn];int main(){ 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); } }}
0 0
- Codeforces-797E-Array Queries(dp)
- codeforces 797 E Array Queries
- codeforces 797E Array Queries
- Codeforces 797E Array Queries
- Codeforces 797E Array Queries
- codeforces 797E Array Queries
- codeforces 797e Array Queries 部分dp+暴力
- Codeforces 797E Array Queries 分块思想
- Educational Codeforces Round 19-E. Array Queries(简单dp)
- Educational Codeforces Round 19 E. Array Queries(分块)
- CodeForces 266E More Queries to Array...
- Educational Codeforces Round 19 E. Array Queries
- Educational Codeforces Round 19-E. Array Queries
- CodeForces 266E More Queries to Array...(线段树+式子展开)
- Codeforces Round #163 (Div. 2) E. More Queries to Array...
- codeforces 266E More Queries to Array 线段树
- 【CodeForces】266E More Queries to Array... 线段树
- CodeForces 266E More Queries to Array... 线段树
- STM32 DMA发送(USART2)
- Using the I2C Bus
- 线程池
- 编程规范 写 if 语句不要任性
- Android中全屏或者取消标题栏
- Codeforces-797E-Array Queries(dp)
- test
- 用pyenv 和 virtualenv 搭建单机多版本python 虚拟开发环境
- LintCode 等价二叉树
- 用Python使用CNTK
- CCF学生排队
- 类的静态成员
- 基于tensorflow的深度学习MultiGPU训练实战
- blockchain区块链是什么?