【MemSQL Start[c]UP 3.0 - Round 1 A】 Declined Finalists
2017-10-04 18:44
417 查看
【链接】h在这里写链接
【题意】
在这里写题意
【题解】
max(最大值-25,0)
【错的次数】
0
【反思】
在这了写反思
【代码】
#include <bits/stdc++.h> using namespace std; int k,ans; int main(){ //freopen("F:\\rush.txt","r",stdin); ios::sync_with_stdio(0),cin.tie(0); cin >> k; for (int i = 1,x;i <= k;i++){ cin >> x; ans = max(ans,x); } if (ans-25>=0){ cout << ans-25<<endl; }else cout << 0 << endl; return 0; }
相关文章推荐
- MemSQL Start[c]UP 3.0 - Round 1 E. Desk Disorder
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) B.Save the Problem!
- MemSQL Start[c]UP 3.0 - Round 1 D. Third Month Insanity
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) C.Ordering Pizza
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) E.Buy Low Sell High
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) 题解
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) B - Save the problem!
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) C - Ordering Pizza
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2)E - Buy Low Sell High
- 【MemSQL Start[c]UP 3.0 - Round 1 E】Desk Disorder
- MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1) B. Ordering Pizza
- 【MemSQL Start[c]UP 3.0 - Round 1 C】 Pie Rules
- 【MemSQL Start[c]UP 3.0 - Round 1 B】 Lazy Security Guard
- MemSQL Start[c]UP 3.0 - Round 2 and Codeforces Round #437 (Div. 1) D. Buy Low Sell High
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) 总结
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) A.Between the Offices
- Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) E
- MemSQL Start[c]UP 2.0 - Round 1
- MemSQL Start[c]UP 2.0 - Round 2 - Online Round(数学:高精度)