HDU 5860 Death Sequence(递推)
来源:互联网 发布:中金公司 知乎 编辑:程序博客网 时间:2024/06/08 12:38
代码:
#include <map>#include <set>#include <stack>#include <queue>#include <cmath>#include <string>#include <vector>#include <cstdio>#include <cctype>#include <cstring>#include <sstream>#include <cstdlib>#include <iostream>#include <algorithm>#pragma comment(linker,"/STACK:102400000,102400000")using namespace std;#define MAX 200005#define MAXN 1000005#define maxnode 205#define sigma_size 26#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define lrt rt<<1#define rrt rt<<1|1#define middle int m=(r+l)>>1#define LL long long#define ull unsigned long long#define mem(x,v) memset(x,v,sizeof(x))#define lowbit(x) (x&-x)#define pii pair<int,int>#define bits(a) __builtin_popcount(a)#define mk make_pair#define limit 10000//const int prime = 999983;const int INF = 0x3f3f3f3f;const LL INFF = 0x3f3f;const double pi = acos(-1.0);const double inf = 1e18;const double eps = 1e-4;const LL mod = 1e9+7;const ull mx = 133333331;/*****************************************************/inline void RI(int &x) { char c; while((c=getchar())<'0' || c>'9'); x=c-'0'; while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0'; }/*****************************************************/int a[3000005];pii c[3000005];int head[3000005];int main(){ int t; cin>>t; while(t--){ int n,k,q; scanf("%d%d%d",&n,&k,&q); int tot=0; int cnt=0; for(int i=1;i<=n;i++) head[i]=-1; for(int i=1;i<=n;i++){ if((i-1)%k==0) a[i]=1; else a[i]=a[i-(i-1)/k-1]+1; c[tot]=mk(i,head[a[i]]); head[a[i]]=tot++; } for(int i=1;i<=n;i++){ if(head[i]==-1) break; int k=cnt+1; for(int j=head[i];j!=-1;j=c[j].second){ a[++cnt]=c[j].first; } int x=cnt; while(k<x){ swap(a[k],a[x]); k++,x--; } } while(q--){ int x; scanf("%d",&x); printf("%d\n",a[x]); } } return 0;}
0 0
- HDU 5860 Death Sequence(递推)
- HDU 5860 Death Sequence(递推)
- HDU 5860 Death Sequence(递推)
- HDU 5860 Death Sequence (DP 递推)
- HDU 5860 Death Sequence
- HDU 5860 Death Sequence
- hdu 5860 Death Sequence(2016 Multi-University Training Contest 10——递推)
- HDU 5860 Death Sequence (递推 + 约瑟夫环 + 思维)——2016 Multi-University Training Contest 10
- 2016多校10 HDU 5860 Death Sequence
- HDU 5860 Death Sequence(dp)
- Death Sequence HDU
- HDOJ 5860 Death Sequence
- HDU 5860 Death Sequence(DP+约瑟夫问题·改)
- hdu5860 Death Sequence
- Hdu5860 Death Sequence
- hdu5860 Death Sequence
- HDU5860-Death Sequence
- hdu 5950 Recursive sequence(递推 快速幂矩阵)
- fastdfs安装与配置
- LeetCode 225. Implement Stack using Queues
- 打印星形符号
- Smith Numbers
- 状态模式
- HDU 5860 Death Sequence(递推)
- 查询python已导入的modules 以及 如何取消已导入的modues
- LightOJ - 1138 Trailing Zeroes (III)
- hive加载数据
- JVM Attach机制实现
- vijos1037搭建双塔(一维背包问题)
- 1026. 程序运行时间(15)
- web前端开发遇到问题记录
- 基于Yahoo网站性能优化的34条军规及自己的见解