Codeforces Round #322 B Luxurious Houses
来源:互联网 发布:软件测试 招聘 编辑:程序博客网 时间:2024/06/05 00:31
题意: 给出你N个数,问你这个数想要比后面的数都大至少要加几?
思路: 有一点点考思路,从后向前找,依次找出最大值,直接比较就可以了,有一点点细节,就是要记录最大数和当前数的下标是否是同一位置,如果是则为0否则,直接算便可、
AC代码:
#include<cstdio>#include<cstring>const int maxn=100100;int a[maxn];int b[maxn];int n;int main(){ while(scanf("%d",&n)!=EOF){ for(int i=0;i<n;i++) scanf("%d",&a[i]); int x=0; int y; for(int i=n-1;i>=0;i--){ if(x<a[i]){ x=a[i]; y=i; } if(y==i) b[i]=x-1; else b[i]=x; } for(int i=0;i<n-1;i++){ if(b[i]>=a[i]) printf("%d ",b[i]-a[i]+1); else printf("0 "); } printf("0\n"); } return 0;}
0 0
- Codeforces Round #322 B Luxurious Houses
- RMQ Codeforces Round #322 (Div. 2) B. Luxurious Houses
- Codeforces Round #322 (Div. 2)B. Luxurious Houses
- CodeForces - 581B Luxurious Houses
- CodeForces 581B Luxurious Houses(简单题)——Codeforces Beta Round #322 (Div. 2)
- Codeforces 625B Luxurious Houses【思维】
- B. Luxurious Houses
- Codefoeces 581B Luxurious Houses
- cf 581 B.Luxurious Houses
- CF#322-B. Luxurious Houses-模拟水题
- Luxurious Houses
- codeforces 581B Luxurious Houses(线段树点更新,区间查询)
- Code Forces 581 B. Luxurious Houses(水~)
- Luxurious Houses(模拟)
- CF581B Luxurious Houses
- Codeforces Round #177 (Div. 1) B. Polo the Penguin and Houses (组合数学)
- Codeforces Round #177 (Div. 1) B - Polo the Penguin and Houses
- coderforce 581B Luxurious Houses(线段树求区间最大)
- 弹出窗口的两种实现方式 PopupWindow 和 Activity
- linux下创建shell脚本
- oracle----sqlldr用法
- mysql修改表、字段、库的字符集
- 使用Three.js + Blender构建在浏览器端显示的3D模型(1)
- Codeforces Round #322 B Luxurious Houses
- Mysql ——1045-Access denied for user 'root'@'localhost'(using password:YES)
- lcd 显示(二)
- Android WebRTC 音视频开发总结(一)
- 如何给FrameWork添加Image, Xib文件
- 详述Linux ftp命令的使用方法
- n!末尾有多少个0
- 自制JAVA容器图
- 做Maximum Subsequence Sum感想