[查找最大最小]ZOJ 2970 Faster, Higher, Stronger
来源:互联网 发布:ashley家具 知乎 编辑:程序博客网 时间:2024/06/06 17:50
直接贴上代码了
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main(){ int cas, p, temp, x = -0x3f3f3f3f, xx = 0x3f3f3f3f; char s[20]; scanf("%d", &cas); while(cas -- ) { x = -0x3f3f3f3f, xx = 0x3f3f3f3f; scanf("%s", s); scanf("%d", &p); if(strcmp(s, "Faster") == 0) { while(p --) { scanf("%d", &temp); if(temp < xx) xx = temp; } printf("%d\n", xx); } else { while(p --) { scanf("%d", &temp); if(temp > x) x = temp; } printf("%d\n", x); } } return 0;}
0 0
- [查找最大最小]ZOJ 2970 Faster, Higher, Stronger
- ZOJ 2970 Faster, Higher, Stronger
- zoj-2970-Faster, Higher, Stronger
- ZOJ 2970Faster, Higher, Stronger
- ZOJ 2970 Faster, Higher, Stronger(排序)
- ZOJ-2970-Faster, Higher, Stronger【5th浙江省赛】
- zoj2970----------------Faster, Higher, Stronger
- Faster, Higher, Stronger
- zoj2970 Faster, Higher, Stronger
- ZOJ2970-Faster, Higher, Stronger
- ZJU oj 2970 Faster, Higher, Stronger(水题)
- F - Faster, Higher, Stronger --- (first qualifying)
- 2014ACM集训13级PK赛5-Faster, Higher, Stronger
- The 5th Zhejiang Provincial Collegiate Programming Contest---ProblemF:Faster, Higher, Stronger
- YOLO9000: Better, Faster, Stronger
- YOLO9000: Better,Faster,Stronger
- YOLO9000: Better, Faster, Stronger
- 【笔记】YOLO9000: Better, Faster, Stronger
- 机器学习(Machine Learning)简介
- nginx---模块介绍
- Java Exception: 六种异常处理的陋习
- 使用Guid值作为数据库行标识
- zoj 1088 约瑟夫环
- [查找最大最小]ZOJ 2970 Faster, Higher, Stronger
- hdu2149Public Sale (巴什博弈)
- eclipse如何快速删除代码中的空行?
- URAL 1167. Bicolored Horses(二维dp或者记忆化搜索)
- poj2349
- 动态下载苹果提供的多种中文字体
- 程序员必看的十大电影
- Git 系列之一:版本控制的概念、分布式、Git 简介及其工作流程
- 测试网口故障的方法-回环水晶头及实验方法