codechef May challenge B
来源:互联网 发布:qq软件功能 编辑:程序博客网 时间:2024/06/04 18:45
WA两次后才发现问题,还是long long 的问题,还有要注意规律性,不然肯定TLE!
快乐地水题吧!!
#include<stdio.h>#define INF 2000000000+10long long a[100005];long long a1[100005],a2[100005];int main(){ int n,k,i; long long maxa=-INF,mina=INF; scanf("%d%d",&n,&k); for(i=1;i<=n;i++) { scanf("%lld",&a[i]); maxa=maxa>a[i]?maxa:a[i]; mina=mina>a[i]?a[i]:mina; } for(i=1;i<=n;i++) a1[i]=maxa-a[i]; maxa=maxa-mina; for(i=1;i<=n;i++) a2[i]=maxa-a1[i]; if(k==0) for(i=1;i<=n;i++) printf("%lld ",a[i]); else if(k%2==1) for(i=1;i<=n;i++) printf("%lld ",a1[i]); else for(i=1;i<=n;i++) printf("%lld ",a2[i]); return 0;}
0 0
- codechef May challenge B
- codechef May challenge A
- codechef May challenge C
- CodeChef May Challenge 2014
- May Challenge 2015(CodeChef 2015年5月月赛)
- codechef December Challenge 2012
- codechef December Challenge 2012
- codechef December Challenge 2012
- codechef July Challenge 2014
- codechef December Challenge 2014
- Codechef February Challenge坑
- CodeChef March Challenge 2015
- Codechef September Challenge 2015
- codechef February Challenge 2016
- Codechef April Challenge 2017
- CodeChef November Challenge 2013 题解
- CodeChef March Challenge 2017 题解
- [题解]CodeChef APRIL Challenge 17
- 有关websphere mq channel 处理
- leetcode 19 Remove Nth Node From End of List
- 深度学习资料整理(压缩感知)
- 音频文件
- 快速排序
- codechef May challenge B
- java算法的基本思想之迭代,递归,动态规划
- Android开发之ListView+EditText-要命的焦点和软键盘问题解决办法:表跟我说什么adjustPan,真心无用~~
- 嵌入式Linux下Camera编程--V4L2
- ShowBorderLayout
- java web开发使用struts实现异步刷新
- leetcode 20 Valid Parentheses
- 深入理解HTTP消息头(一)
- 22天养成好习惯,一年后脱胎换骨!