{"action":"opened","issue":{"url":"https://api.github.com/repos/MFunction96/hs2znoip/issues/4","repository_url":"https://api.github.com/repos/MFunction96/hs2znoip","labels_url":"https://api.github.com/repos/MFunction96/hs2znoip/issues/4/labels{/name}","comments_url":"https://api.github.com/repos/MFunction96/hs2znoip/issues/4/comments","events_url":"https://api.github.com/repos/MFunction96/hs2znoip/issues/4/events","html_url":"https://github.com/MFunction96/hs2znoip/issues/4","id":245909256,"number":4,"title":"D - Codeforces262B - Roma and Changing Signs","user":{"login":"MFunction96","id":19974616,"avatar_url":"https://avatars0.githubusercontent.com/u/19974616?v=4","gravatar_id":"","url":"https://api.github.com/users/MFunction96","html_url":"https://github.com/MFunction96","followers_url":"https://api.github.com/users/MFunction96/followers","following_url":"https://api.github.com/users/MFunction96/following{/other_user}","gists_url":"https://api.github.com/users/MFunction96/gists{/gist_id}","starred_url":"https://api.github.com/users/MFunction96/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/MFunction96/subscriptions","organizations_url":"https://api.github.com/users/MFunction96/orgs","repos_url":"https://api.github.com/users/MFunction96/repos","events_url":"https://api.github.com/users/MFunction96/events{/privacy}","received_events_url":"https://api.github.com/users/MFunction96/received_events","type":"User","site_admin":false},"labels":[{"id":655014596,"url":"https://api.github.com/repos/MFunction96/hs2znoip/labels/Round1","name":"Round1","color":"b60205","default":false},{"id":655820105,"url":"https://api.github.com/repos/MFunction96/hs2znoip/labels/%E7%AE%80%E5%8D%95%E9%A2%98","name":"简单题","color":"1d76db","default":false},{"id":655834798,"url":"https://api.github.com/repos/MFunction96/hs2znoip/labels/%E8%B4%AA%E5%BF%83%E6%B3%95","name":"贪心法","color":"5319e7","default":false}],"state":"open","locked":false,"assignee":{"login":"MFunction96","id":19974616,"avatar_url":"https://avatars0.githubusercontent.com/u/19974616?v=4","gravatar_id":"","url":"https://api.github.com/users/MFunction96","html_url":"https://github.com/MFunction96","followers_url":"https://api.github.com/users/MFunction96/followers","following_url":"https://api.github.com/users/MFunction96/following{/other_user}","gists_url":"https://api.github.com/users/MFunction96/gists{/gist_id}","starred_url":"https://api.github.com/users/MFunction96/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/MFunction96/subscriptions","organizations_url":"https://api.github.com/users/MFunction96/orgs","repos_url":"https://api.github.com/users/MFunction96/repos","events_url":"https://api.github.com/users/MFunction96/events{/privacy}","received_events_url":"https://api.github.com/users/MFunction96/received_events","type":"User","site_admin":false},"assignees":[{"login":"MFunction96","id":19974616,"avatar_url":"https://avatars0.githubusercontent.com/u/19974616?v=4","gravatar_id":"","url":"https://api.github.com/users/MFunction96","html_url":"https://github.com/MFunction96","followers_url":"https://api.github.com/users/MFunction96/followers","following_url":"https://api.github.com/users/MFunction96/following{/other_user}","gists_url":"https://api.github.com/users/MFunction96/gists{/gist_id}","starred_url":"https://api.github.com/users/MFunction96/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/MFunction96/subscriptions","organizations_url":"https://api.github.com/users/MFunction96/orgs","repos_url":"https://api.github.com/users/MFunction96/repos","events_url":"https://api.github.com/users/MFunction96/events{/privacy}","received_events_url":"https://api.github.com/users/MFunction96/received_events","type":"User","site_admin":false}],"milestone":null,"comments":0,"created_at":"2017-07-27T02:36:40Z","updated_at":"2017-07-27T02:36:40Z","closed_at":null,"body":"本题为阅读题，读懂后即可明白使用贪心法，比较简单。\r\n\r\n**贪心策略：**\r\n- 尽可能所有数变成正数\r\n- 如果不能所有数变正数，尽可能让绝对值大的数变成正数。\r\n\r\n**注意：** \r\n- 题干中描述同一个数可以变许多次，没有次数限制\r\n- 一定会做`k`次操作，不能多不能少\r\n\r\n因此，只需要根据负数个数与操作数的关系，分情况计算即可Accepted。\r\n\r\n[Accepted代码](https://github.com/MFunction96/hs2znoip/blob/master/Round1/D.cpp)"}}
{"actor":{"display_login":"MFunction96"}}