codeforces
文章平均质量分 82
liyunlong41
你必须非常努力,才能看起来毫不费力。
展开
-
codeforcesC. Amr and Chemistry
C. Amr and Chemistrytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr loves Chemistry, and specially doing experime原创 2015-07-15 12:42:05 · 571 阅读 · 0 评论 -
codeforces 603 C. Load Balancing 贪心
C. Load Balancingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the school computer room there are n servers whi原创 2015-12-26 23:05:57 · 591 阅读 · 0 评论 -
codeforces 608B Hamming Distance Sum
B. Hamming Distance Sumtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGenos needs your help. He was asked to solve the follow原创 2015-12-26 22:49:15 · 818 阅读 · 0 评论 -
codeforces D. The Union of k-Segments 排序
Sample test(s)Input3 20 5-3 23 8Output20 23 5Input3 20 5-3 33 8Output10 5题意: 给定n条线段的起点和终点, 让你输出所有的被这些线段覆盖了至少k次的区间, 如果两个区间能够合并,那么输出他们的合并的结果. 比如0-3,3-5要输出原创 2015-12-29 20:54:58 · 430 阅读 · 0 评论 -
codeforces round321 DIV2
http://codeforces.com/contest/580A. Kefa and First Stepstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKefa原创 2015-09-25 19:47:16 · 701 阅读 · 0 评论 -
codeforces 567C
mp2存放每个数当中间的数的次数,对每个数,如果有a[i]%k==0,那么ans就加上mp2[a[i]/k],mp表示这个数当第一个数的次数,对每个数,如果有a[i]%k==0,那么mp2[a[i]]就加上mp[a[i]/k]。#include#include#include#include#include#include#include#include#include#原创 2015-08-18 11:47:01 · 644 阅读 · 0 评论 -
codeforces 567D 二分
满足二分的条件,如果当前的断点不符合条件,那么后面的一定不符合条件,如果当前的符合条件,那么后面的可能还有符合条件的。二分的过程中对断点进行排序,判断每个区间能放多少船只,总和加起来,判断是不是小于k。#include#include#include#include#include#include#include#include#include#include#原创 2015-08-18 11:42:38 · 439 阅读 · 0 评论 -
codeforces 25C. Roads in Berland
有n个城市,每个城市都能到达别的城市,n*n的矩阵表明i到j城市的最短距离,现在要建造一些新的道路,在两个城市之间。问每次建造这些道路之后每两个城市之间的距离之和为多少。如果新建的道路比当前的最短道路要长,那么总和不会更新,如果要短的话,那么要把当前道路最短距离更新。同时枚举其他各个城市之间的距离有没有变小。假设t1到t2之间距离更新了,对于任意两个城市i,j,要比较一下从i到j的最短距离原创 2015-08-03 14:17:37 · 758 阅读 · 0 评论 -
codeforces 558A. Lala Land and Apple Trees
A. Lala Land and Apple Trees time limit per test 1 second原创 2015-07-15 12:02:14 · 945 阅读 · 0 评论 -
codeforcesB. Amr and The Large Array
B. Amr and The Large Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr has got a large array of size n. Amr doesn't like large arr原创 2015-07-15 12:29:17 · 854 阅读 · 0 评论 -
codeforces C. Sorting Railway Cars 贪心
C. Sorting Railway Carstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAn infinitely long railway has a train consis原创 2015-12-27 00:08:26 · 2631 阅读 · 1 评论