codeforces 301 A Yaroslav and Sequence
2013-06-03 17:54
295 查看
今天是肿么了?开始没有看懂题意,以为是水题,交了一遍wa了,,再看看发现看错题了,改改再交还是wa..在看看题,总算看懂题了,但是把样例算错了,,一直以为是看错题了..一直看啊看,几个小时过去了都没有看明白..<中间开了一个会,还有看了一点别人的博客>..原来是自己算错了.以后一定要用手算了,
#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <queue> #include <cmath> #include <stack> #include <map> #include <string> #define LL long long #define DB double using namespace std; const int N = 2009; int re ; int get(int n) { int ret =0 ; for(int i=0;i<n;i++) ret+=re[i]; return ret; } int main() { #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); #endif int ans = 0; int n;scanf("%d",&n); for(int i=0;i<(n<<1)-1;i++) scanf("%d",&re[i]); if(n&1) { for(int i=0;i<(n<<1);i++) ans += abs(re[i]); }else { int x =0 ; for(int i=0;i<(n<<1);i++) if(re[i]<0) x++; if(x&1) { int x = 0x3f3f3f3f; for(int i=0;i<(n<<1)-1;i++) { x = min(x,abs(re[i])); } for(int i=0;i<(n<<1);i++) ans+=abs(re[i]); ans -= 2*x; }else { for(int i=0;i<(n<<1);i++) ans+=abs(re[i]); } } cout<<ans<<endl; return 0; }
相关文章推荐
- codeforces 301a Yaroslav and Sequence
- Yaroslav and Sequence - CodeForces 301A 水题
- Codeforces 301A Yaroslav and Sequence 【思维】
- 【CF】CodeForces 301A Yaroslav and Sequence
- CodeForces--301B--Yaroslav and Time(弗洛伊德)
- codeforces 301D Yaroslav and Divisors(树状数组)
- Yaroslav and Time - CodeForces 301B Dijkstra
- codeforces 295E Yaroslav and Points (线段树)
- Codeforces Round #182 (Div. 2)---C. Yaroslav and Sequence(不错的题,分析找规律)
- Codeforces Round #179 (Div. 2) B (codeforces 296b) Yaroslav and Two Strings
- CodeForces - 272B Dima and Sequence 函数/思维
- codeforces 301D. Yaroslav and Divisors(遍历和排序的艺术)
- codeforces 295E Yaroslav and Points (离线操作+离散化+区间合并)
- Codeforces 301_div.2_Ice Cave(BFS走冰块)
- CodeForces 296A Yaroslav and Permutations
- A. Yaroslav and Sequence
- codeforces 301 E. Infinite Inversions
- Codeforces 301(div 2) C. Ice Cave
- 4000 codeforces 296B - Yaroslav and Two Strings (DP+容斥)
- Codeforces 301B Yaroslav and Time 【最短路】