Codeforces Round #849 (Div. 4) 1791E - Negatives and Positives Solution



 Problem Link : https://codeforces.com/contest/1791/problem/E

Solution in C++:

  1. /// La ilaha illellahu muhammadur rasulullah
  2. ///******Bismillahir-Rahmanir-Rahim******///
  3. /// Abul Hasnat Tonmoy
  4. /// Department of CSE,23rd batch
  5. /// Islamic University,Bangladesh
  6. ///**********ALLAH IS ALMIGHTY************///
  7. #include <bits/stdc++.h>
  8. using namespace std ;
  9. int32_t main() {
  10. ios_base::sync_with_stdio(0);
  11. cin.tie(0);
  12. int t ;
  13. cin >> t ;
  14. while ( t-- ){
  15. int n ;
  16. cin >> n ;
  17. long long a[n+3] , cnt = 0 ;
  18. long long sum = 0 , mn = 1e9 ;
  19. for ( int i = 0 ; i < n ; i++ ){
  20. cin >> a[i] ;
  21. sum += abs(a[i]) ;
  22. mn = min ( mn , abs(a[i]) ) ;
  23. if ( a[i] < 0 ) cnt++;
  24. }
  25. if ( cnt % 2 == 0 ) cout << sum << endl;
  26. else {
  27. cout << sum - (mn+mn)<< endl;
  28. }
  29. }
  30.  
  31. }


No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.