Knight Tournament CodeForces
来源:互联网 发布:朱元璋书法 知乎 编辑:程序博客网 时间:2024/05/16 05:22
点击打开链接
模拟链表 next[i]表示第i个元素左边(右边亦可)第一个需要改变的元素
亦可用并查集
#include <stdio.h>int f[300010],next[300010];int min(int u,int v);int main(){ int n,m,i,j,x,y,z,t; while(scanf("%d%d",&n,&m)!=EOF) { for(i=1;i<=n;i++) { f[i]=0; next[i]=i+1; } while(m--) { scanf("%d%d%d",&x,&y,&z); for(i=x;i<=y;i=t) { if(f[i]==0&&i!=z) f[i]=z; t=next[i]; if(i<z) { next[i]=z; } else { next[i]=next[y]; } } } for(i=1;i<n;i++) { printf("%d ",f[i]); } printf("%d\n",f[i]); } return 0;}int min(int u,int v){ if(u<v) return u; else return v;}
阅读全文
0 0
- Knight Tournament CodeForces
- codeforces 357C Knight Tournament
- CodeForces 356A Knight Tournament 【线段树】
- CodeForces 357C - Knight Tournament(模拟)
- Codeforces #356C: Knight Tournament 题解
- Knight Tournament
- Knight Tournament
- Codeforces Round #207 (Div. 2) C. Knight Tournament
- CodeForces 356A - Knight Tournament set or 线段树
- Codeforces Round #207 (Div. 2) C. Knight Tournament
- Codeforces Round #207 (Div. 2) C. Knight Tournament
- Codeforces Round #207 (Div. 2) C. Knight Tournament (并查集缩点)
- Codeforces 356A Knight Tournament线段树区间覆盖
- Codeforces Round #207 (Div. 2)---C. Knight Tournament(set乱搞)
- Codeforces Round #207 (Div. 2) C - Knight Tournament
- Codeforces 357C Knight Tournament【并查集】
- 356A - Knight Tournament
- ACM->CF Knight Tournament
- 14 Three.js绘制字体模型
- B1036
- 【Redis进阶】redis.conf详解
- Opencv--Mat笔记
- MST
- Knight Tournament CodeForces
- OpenGL 绘制二维图形
- [BZOJ2237]龙珠雷达
- ubuntu安装cuda8.0+tensorflow+pytorch
- 朴素贝叶斯
- 真正理解线程上下文类加载器:tomcat and Spring
- 今年暑假不AC(贪心)
- 树形DP
- xml 笔记1