# Mahmoud and a Message CodeForces - 766C (dp)

Mahmoud wrote a message s of length n. He wants to send it as a birthday present to his friend Moaz who likes strings. He wrote it on a magical paper but he was surprised because some characters disapp...

# Godsend CodeForces - 841B

Leha somehow found an array consisting of n integers. Looking at it, he came up with a task. Two players play the game on the array. Players move one by one. The first player can choose for his move a...

# Leha and Function CodeForces - 841C （greedy）

Leha like all kinds of strange things. Recently he liked the function F(n, k). Consider all possible k-element subsets of the set [1, 2, …, n]. For subset find minimal element in it. F(n, k) — mathemat...

# Maximum Subsequence CodeForces - 888E （二分+状压）

You are given an array a consisting of n integers, and additionally an integer m. You have to choose some sequence of indices b1, b2, …, bk (1 ≤ b1 < b2 < … < bk ≤ n) in such a way that the value of i...

# Almost Identity Permutations CodeForces - 888D （错排公式）

A permutation p of size n is an array such that every integer from 1 to n occurs exactly once in this array.Let’s call a permutation an almost identity permutation iff there exist at least n - k indice...

# K-Dominant Character CodeForces - 888C

You are given a string s consisting of lowercase Latin letters. Character c is called k-dominant iff each substring of s with length at least k contains this character c.You have to find minimum k such...

# Short Program CodeForces - 878A

Petya learned a new programming language CALPAS. A program in this language always takes one non-negative integer and returns one non-negative integer as well.In the language, there are only three comm...

# Being a Hero HDU - 3251 （最小割）

You are the hero who saved your country. As promised, the king will give you some cities of the country, and you can choose which ones to own! But don’t get too excited. The cities you take should NOT...

# Game HDU - 3657（还是算最小割吧）

onmylove has invented a game on n × m grids. There is one positive integer on each grid. Now you can take the numbers from the grids to make your final score as high as possible. The way to get score i...

# Thieves HDU - 3491（最小点割集）

In the kingdom of Henryy, there are N (2 <= N <= 100) cities, with M (M <= 10000) two-direct ways connecting them. A group of thieves from abroad plan to steal the metropolitan museum in city H (It h...

# King of Destruction HDU - 3002(全局最小割）

Zhou xingxing is the successor of one style of kung fu called “Karate Kid”.he is falling love with a beautiful judo student,after being humiliated by her boyfriend,a Taekwando master from Japan,Zhou is...

# Tour HDU - 3488(带权二分匹配)（最小花费最大流）

In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the kingdom. The route should be...

174条 共12页1 2 3 4 5 ... 下一页 尾页
个人资料
• 访问：15544次
• 积分：1805
• 等级：
• 排名：千里之外
• 原创：174篇
• 转载：0篇
• 译文：0篇
• 评论：0条
阅读排行
评论排行