友人-A

2019年10月11日

摘要： E. Jzzhu and Apples time limit per test: 1 seconds memory limit per test: 256 megabytes input: standard input output: standard output Jzzhu has picked 阅读全文

posted @ 2019-10-11 18:52 友人-A 阅读(204) 评论(0) 推荐(0)

Codeforces 450D：Jzzhu and Cities（最短路，dijkstra）

摘要： D. Jzzhu and Cities time limit per test: 2 seconds memory limit per test: 256 megabytes input: standard input output: standard output Jzzhu is the pre 阅读全文

posted @ 2019-10-11 12:08 友人-A 阅读(156) 评论(0) 推荐(0)

2019年9月25日

洛谷 P3431：[POI2005]AUT-The Bus（离散化+DP+树状数组）

摘要：题目描述 The streets of Byte City form a regular, chessboardlike network they are either north south or west east directed. We shall call them NS and WE s 阅读全文

posted @ 2019-09-25 10:10 友人-A 阅读(188) 评论(0) 推荐(0)

2019年9月23日

Codeforces 777E：Hanoi Factory（贪心）

摘要： Of course you have heard the famous task about Hanoi Towers, but did you know that there is a special factory producing the rings for this wonderful g 阅读全文

posted @ 2019-09-23 13:07 友人-A 阅读(535) 评论(0) 推荐(0)

2019年9月22日

2019HPU-ICPC-Training-1

摘要： byl太强了，学弟们太强了～全程被吊打，嘤嘤嘤～ A题 Connecting Vertices http://codeforces.com/problemset/problem/888/F 不会 B题 Local Extrema http://codeforces.com/problemset/pr 阅读全文

posted @ 2019-09-22 22:04 友人-A 阅读(412) 评论(0) 推荐(0)

Codeforces 777B：Game of Credit Cards（贪心）

摘要： After the fourth season Sherlock and Moriary have realized the whole foolishness of the battle between them and decided to continue their competitions 阅读全文

posted @ 2019-09-22 21:40 友人-A 阅读(410) 评论(0) 推荐(0)

Codeforces 777D：Cloud of Hashtags（暴力，水题）

摘要： Vasya is an administrator of a public page of organization "Mouse and keyboard" and his everyday duty is to publish news from the world of competitive 阅读全文

posted @ 2019-09-22 21:20 友人-A 阅读(505) 评论(0) 推荐(0)

Codeforces 777C：Alyona and Spreadsheet（预处理）

摘要： During the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables. Now she has a table filled with 阅读全文

posted @ 2019-09-22 21:06 友人-A 阅读(351) 评论(0) 推荐(0)

Codeforces 888D： Almost Identity Permutations（错排公式，组合数）

摘要： 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 almos 阅读全文

posted @ 2019-09-22 20:46 友人-A 阅读(427) 评论(0) 推荐(0)

Codeforces 888E：Maximum Subsequence（枚举，二分）

摘要： You are given an array a consisting of n integers, and additionally an integer m . You have to choose some sequence of indices $b_1, b_2, ..., b_k (1 阅读全文

posted @ 2019-09-22 20:28 友人-A 阅读(365) 评论(0) 推荐(0)

公告