摘要： Moscow is hosting a major international conference, which is attended by n scientists from different countries. Each of the scientists knows exactly o 阅读全文

摘要： Best Cow Fences Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 16945 Accepted: 5425 Description Farmer John's farm consists of a long row 阅读全文

摘要： 0304 IncDec Sequence 0x00「基本算法」例题 描述 给定一个长度为 n(n≤10^5 ) 的数列 {a_1,a_2,…,a_n}，每次可以选择一个区间 [l,r]，使下标在这个区间内的数都加一或者都减一。 求至少需要多少次操作才能使数列中的所有数都一样，并求出在保证最少次数的前 阅读全文

摘要： Tallest Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5425 Accepted: 2500 Description FJ's N (1 ≤ N ≤ 10,000) cows conveniently index 阅读全文

摘要： To the Max Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 56579 Accepted: 29921 Description Given a two-dimensional array of positive and 阅读全文

摘要： 激光炸弹 HYSBZ - 1218Time limit：10000 msMemory limit：165888 kBOS：LinuxSource：HNOI2003 一种新型的激光炸弹，可以摧毁一个边长为R的正方形内的所有的目标。现在地图上有n(N<=10000)个目标，用整数Xi,Yi(其值在[0, 阅读全文

摘要： Counting Cliques HDU - 5952 OJ-ID： hdu-5952author：Caution_Xdate of submission：20191110tags：dfs,graphdescription modelling：给定点数，边数，问包含有x个点的完全图种类数major 阅读全文

摘要： Nearest Common Ancestors POJ - 1330 A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In th 阅读全文

摘要： E - Long Jumps CodeForces - 479D Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery h 阅读全文

摘要： Nearest Common Ancestors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 39816 Accepted: 19722 Description A rooted tree is a well-known da 阅读全文