枚举
RikkaTheWorld
一个OTAKU
展开
-
Codeforces Round #336 (Div. 2) B. Hamming Distance Sum
B. Hamming Distance Sum time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Genos needs your help. He was asked原创 2015-12-26 17:41:14 · 574 阅读 · 0 评论 -
Codeforces546B Soldier and Badges
Description Colonel has n badges. He wants to give one badge to every of his n soldiers. Each badge has a coolness factor, which shows how much it's owner reached. Coolness factor can be increase原创 2016-07-27 17:20:16 · 391 阅读 · 2 评论 -
UVA 10010-- Where's Waldorf?
原题网址:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=951 直接暴力搜索,有点麻烦但是不是很难。 #include #include #include #include using namespace std; #define N 10000 c原创 2016-07-18 10:55:02 · 360 阅读 · 0 评论 -
Codeforces Round #363B (Div. 2) One Bomb
You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (".") or it can be occupied by a wall ("*"). You have one bomb. If you原创 2016-07-20 10:00:28 · 257 阅读 · 0 评论 -
codeforces #334 B. Eight Point Sets
题目链接:传送门 题意:有n个人在玩游戏,每局游戏只能玩n-1个人,剩下的一个人去当裁判 第i个人想玩ai局,问最少玩多少局能使得每个人都能玩完他们想玩的局。 做法:先求出sum(a[i]),求出最大的a[i]为Max 那么玩局数至少是Max,Max*(n-1)就是玩Max局数的总人数 如果它大于sum,则玩Max局就能让所有人都玩完。 否则则要找出某个局数x使得 x*(n-1)>=sum原创 2016-09-27 15:51:29 · 619 阅读 · 0 评论 -
51nod 1100 斜率最大
题目链接:传送门 计算几何水题,排序遍历一遍能过,要考虑斜率的正负值 代码如下:#include <bits/stdc++.h> using namespace std; #define N 10010 #define mod 100000 #define inf 2000000000000000ll struct rng{ int x,y; int num; }t[N]; in原创 2016-12-07 21:25:28 · 448 阅读 · 0 评论 -
codeforces 733B parade
题目链接:传送门 给你n行,每行有个li,和ri 美丽值是|l-r| 分别是l和r的总和 要求交换一行的r和l值,使得美丽值最大,若没有可以更大了输出0 巨水,求出l和r的总和,在遍历的时候减去这个l和r在分别加上r和l比较就行了 代码如下:#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #原创 2017-01-16 22:43:29 · 421 阅读 · 0 评论