Luxurious Houses
来源:互联网 发布:agile java 编辑:程序博客网 时间:2024/06/18 13:57
題目鏈接
本題屬於簡單的implementation。
有
定義若這個房子的臺階數「嚴格大於」右邊所有房子的臺階數,那麼這個房子是「豪華的」。
依次輸出
臺階數的增加並不是實際修改
用數組
即
本題的重點是,第
CF的題是有special judge的。所以行末多輸出一堆空格也沒事。
#include<bits/stdc++.h>using namespace std;const int maxn = 2e5+7;long long a[maxn],m[maxn];main(){ int n; cin >> n; for(int i = 1;i<=n;i++){ cin >> a[i]; } for(int i = n;i>=1;i--){ m[i] = max(m[i+1],a[i]); } for(int i = 1;i<=n;i++){ if(m[i+1] == m[i]){ cout << m[i]-a[i]+1; }else cout << m[i]-a[i]; cout << " "; }}
阅读全文
0 0
- Luxurious Houses
- Luxurious Houses(模拟)
- CF581B Luxurious Houses
- B. Luxurious Houses
- Codefoeces 581B Luxurious Houses
- cf 581 B.Luxurious Houses
- CodeForces - 581B Luxurious Houses
- Codeforces Round #322 B Luxurious Houses
- Codeforces 625B Luxurious Houses【思维】
- CF#322-B. Luxurious Houses-模拟水题
- RMQ Codeforces Round #322 (Div. 2) B. Luxurious Houses
- Codeforces Round #322 (Div. 2)B. Luxurious Houses
- Code Forces 581 B. Luxurious Houses(水~)
- codeforces 581B Luxurious Houses(线段树点更新,区间查询)
- CodeForces 581B Luxurious Houses(简单题)——Codeforces Beta Round #322 (Div. 2)
- coderforce 581B Luxurious Houses(线段树求区间最大)
- rob houses
- 1716. Houses (邻接矩阵)
- 面试题28字符串的排列
- Java基础四
- 《挑战程序设计竞赛》阅读笔记一 之 ALDS1_1_D Maximum Profit
- JAVA变量与常量应用示例
- C++/MFC-进程Process
- Luxurious Houses
- iPhone销量在大中华区营收缩水14%
- Spring的scope="prototype"解决多线程问题
- 深入JVM内核---GC算法
- Canvas绘制Text文本居中
- H.264 H.264RTP发送和接收
- eclipse中装tomcat7.0
- scrapy cluster搭建实录
- poj1915之双向广搜