1180B - Nick and Array - CodeForces Solution


greedy implementation *1500

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);   
    
    int n;
    cin>>n;
    vector<int> a(n);

    for(int i=0;i<n;i++)
        cin>>a[i];

    for(int i=0;i<n;i++)
        if(a[i]>=0)
            a[i]=-a[i]-1;
    

    int maxi=INT_MIN;
    int ind=-1;
    for(int i=0;i<n;i++)
    {
        if(abs(a[i])>maxi)
        {
            maxi=abs(a[i]);
            ind=i;
        }
    }

    if(n&1)
        a[ind]=-a[ind]-1;
        
    for(auto i:a)
    {
        cout<<i<<" ";
    }
    cout<<endl;

return 0;
}


Comments

Submit
0 Comments
More Questions

1523B - Lord of the Values
1406C - Link Cut Centroids
2409. Count Days Spent Together
2410. Maximum Matching of Players With Trainers
1604C - Di-visible Confusion
997A - Convert to Ones
218A - Mountain Scenery
486B - OR in Matrix
1405A - Permutation Forgery
1733A - Consecutive Sum
1733B - Rule of League
1733C - Parity Shuffle Sorting
1264A - Beautiful Regional Contest
1695A - Subrectangle Guess
467B - Fedor and New Game
252C - Points on Line
735C - Tennis Championship
992A - Nastya and an Array
554A - Kyoya and Photobooks
79B - Colorful Field
265B - Roadside Trees (Simplified Edition)
1362C - Johnny and Another Rating Drop
1214C - Bad Sequence
1091B - New Year and the Treasure Geolocation
244A - Dividing Orange
1061C - Multiplicity
1312A - Two Regular Polygons
801A - Vicious Keyboard
510B - Fox And Two Dots
616D - Longest k-Good Segment