<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[GF0919的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/GF0919</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; GF0919]]></copyright><item><title><![CDATA[7-12 学生选课信息管理]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/135153629</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/135153629</guid><author>GF0919</author><pubDate>Fri, 22 Dec 2023 15:03:57 +0800</pubDate><description><![CDATA[一个有参构造方法，创建指定学号stuID、姓名stuName的学生，构造方法中输出“学生类有参构造方法”；一个有参构造方法，创建指定课程编号cID、课程名cName的课程，构造方法中输出“课程类有参构造方法”；设计一个学生选课信息管理系统，从屏幕读入学生、课程信息，执行学生选课操作，并显示选课结果。一个无参构造方法，创建默认的学生，构造方法中输出“学生类无参构造方法”；一个无参构造方法，创建默认的课程，构造方法中输出“课程类无参构造方法”；01    Tom    c03    Java基础。]]></description><category></category></item><item><title><![CDATA[F - New Year Snowmen]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132854683</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132854683</guid><author>GF0919</author><pubDate>Wed, 13 Sep 2023 15:13:50 +0800</pubDate><description><![CDATA[As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs: a big one, a medium one and a small one. Sergey's twins help him: they've already made n snowballs with radi]]></description><category></category></item><item><title><![CDATA[R - Sonya and Hotels]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132824523</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132824523</guid><author>GF0919</author><pubDate>Tue, 12 Sep 2023 09:54:21 +0800</pubDate><description><![CDATA[Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.The country where Sonya lives is an endless line. There is a city in each integer coordinate on this line. She has nn hotel]]></description><category></category></item><item><title><![CDATA[O - Muddy roads]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132812636</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132812636</guid><author>GF0919</author><pubDate>Mon, 11 Sep 2023 16:43:48 +0800</pubDate><description><![CDATA[农民约翰想用几块等长的木板遮住他的农场，输入遮住距离有几段和木板的长度，和每段被遮住位置的起止位置，求出所用木板最少的数量。]]></description><category></category></item><item><title><![CDATA[G - Polycarp and Div 3]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132809191</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132809191</guid><author>GF0919</author><pubDate>Mon, 11 Sep 2023 15:21:59 +0800</pubDate><description><![CDATA[【代码】G - Polycarp and Div 3。]]></description><category></category></item><item><title><![CDATA[H - Yogurt factory]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132800464</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132800464</guid><author>GF0919</author><pubDate>Mon, 11 Sep 2023 09:43:20 +0800</pubDate><description><![CDATA[The cows have purchased a yogurt factory that makes world-famous Yucky Yogurt. Over the next N (1 <= N <= 10,000) weeks, the price of milk and labor will fluctuate weekly such that it will cost the company C_i (1 <= C_i <= 5,000) cents to produce one unit ]]></description><category></category></item><item><title><![CDATA[I - Protecting the Flowers]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132791256</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132791256</guid><author>GF0919</author><pubDate>Sun, 10 Sep 2023 14:58:37 +0800</pubDate><description><![CDATA[有 n 头奶牛跑到 FJ 的花园里去吃花儿了，它们分别在距离牛圈 Ti​（这里指 FJ 到那里需要 Ti​ 分钟) 处吃花，每分钟会吃掉 Di​ 朵花，FJ 现在要将它们给弄回牛圈，但是他每次只能弄一头回去，来回用时总共为 2×Ti​ 分钟，在这段时间内，其它的奶牛会继续吃 FJ 的花，速度保持不变，当然正在被赶回牛圈的奶牛不能继续吃了。现在求在最好的方案下奶牛吃掉花的最小朵数。]]></description><category></category></item><item><title><![CDATA[J - Allowance]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132790599</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132790599</guid><author>GF0919</author><pubDate>Sun, 10 Sep 2023 13:59:30 +0800</pubDate><description><![CDATA[【代码】J - Allowance。]]></description><category></category></item><item><title><![CDATA[N - 不重叠的线段]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132789786</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132789786</guid><author>GF0919</author><pubDate>Sun, 10 Sep 2023 12:25:12 +0800</pubDate><description><![CDATA[X轴上有N条线段,每条线段有1个起点S和终点E。最多能够选出多少条互不重叠的线段。(注：起点或终点重叠,不算重叠)。例如：[1 5][2 3][3 6],可以选[2 3][3 6],这22条线段互不重叠。第 2∼N+1行：每行2个数,线段的起点和终点（−109≤S,E≤109 )第1行：1个数N,线段的数量（1<=2≤N≤10000 )输出最多可以选择的线段数量。]]></description><category></category></item><item><title><![CDATA[M - 独木舟 (双指针)]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132781879</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132781879</guid><author>GF0919</author><pubDate>Sat, 09 Sep 2023 20:38:44 +0800</pubDate><description><![CDATA[n 个人，已知每个人体重 wi。独木舟承重固定，每只独木舟最多坐两个人，即可以坐一个人或者两个人。显然要求每只独木舟承载的总重量不能超过独木舟的承重 m。假设每个人体重也不超过 m ，问最少需要几只独木舟？（其中 0 < n <1e4,  0<wi≤m≤2e9 ，且 wi≤1e9 ）接下来 n 行，每行一个正整数 wi ，表示每个人的体重。第一行包含两个正整数 n,m ，表示人数和独木舟的承重。一行一个整数表示最少需要的独木舟数。]]></description><category></category></item><item><title><![CDATA[E - 找连续数]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132778655</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132778655</guid><author>GF0919</author><pubDate>Sat, 09 Sep 2023 15:59:06 +0800</pubDate><description><![CDATA[第一行包含两个整数n，m，n代表数组中有多少个数字，m 代表针对于此数组的询问次数，n不会超过10的4次方，m 不会超过1000。第二行包含n个正整数，第 I 个数字代表无序数组的第 I 位上的数字，数字大小不会超过2的31次方。小度熊拿到了一个无序的数组，对于这个数组，小度熊想知道是否能找到一个k 的区间，里面的 k 个数字排完序后是连续的。然后对于每个询问的 k，输出一行包含一个整数，代表数组中满足条件的 k 的大小的区间的数量。(由于只有一组样例，只输出”Case #1:”即可)]]></description><category></category></item><item><title><![CDATA[D - 超级赛亚ACMer]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132777094</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132777094</guid><author>GF0919</author><pubDate>Sat, 09 Sep 2023 14:25:07 +0800</pubDate><description><![CDATA[也就是第一次比赛如果激发了百小度的斗志，他能把战斗力提升0~k的任一值，如果第二次比赛继续被激发斗志，他能在第一次提升后的基础上，把战斗力再提升0 ~ max(0, k-1),依次类推…如果百小度的战斗力等于对方，那么百小度在获胜的同时也会感到很吃力，但是这会激发百小度的斗志，使得他刻苦刷题，在下场PK赛之前，战斗力最多提升k点（即可以提升0~k点任意值）.m是百小度的初始战斗力上限，也就是百小度第一次进行PK赛的时候，可以选择0~m的任意一个值作为他的战斗力.否则再输出"madan!]]></description><category></category></item><item><title><![CDATA[C - Songs Compression]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132765748</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132765748</guid><author>GF0919</author><pubDate>Fri, 08 Sep 2023 18:30:46 +0800</pubDate><description><![CDATA[Ivan has nn songs on his phone. The size of the ii-th song is a_iai​ bytes. Ivan also has a flash drive which can hold at most mm bytes in total. Initially, his flash drive is empty.Ivan wants to copy all nn songs to the flash drive. He can compress the so]]></description><category></category></item><item><title><![CDATA[B - Polycarp‘s Practice]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132756732</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132756732</guid><author>GF0919</author><pubDate>Fri, 08 Sep 2023 11:23:26 +0800</pubDate><description><![CDATA[Polycarp is practicing his problem solving skill. He has a list of nn problems with difficulties a_1, a_2, \dots, a_na1​,a2​,…,an​, respectively. His plan is to practice for exactly kk days. Each day he has to solve at least one problem from his list. Poly]]></description><category></category></item><item><title><![CDATA[A - Turn the Rectangles]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132754851</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132754851</guid><author>GF0919</author><pubDate>Fri, 08 Sep 2023 10:24:38 +0800</pubDate><description><![CDATA[【代码】A - Turn the Rectangles。]]></description><category></category></item><item><title><![CDATA[A - Orac and Models（最长上升子序列——加强版）]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132745067</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132745067</guid><author>GF0919</author><pubDate>Thu, 07 Sep 2023 20:01:39 +0800</pubDate><description><![CDATA[给出n个数的值，求出满足下标j整除i并且a[j]>a[i]的最多个数（j>i)]]></description><category></category></item><item><title><![CDATA[E - Stoned Game]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132745035</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132745035</guid><author>GF0919</author><pubDate>Thu, 07 Sep 2023 19:55:21 +0800</pubDate><description><![CDATA[【代码】E - Stoned Game。]]></description><category></category></item><item><title><![CDATA[B - Sage‘s Birthday (hard version)]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132744294</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132744294</guid><author>GF0919</author><pubDate>Thu, 07 Sep 2023 19:04:13 +0800</pubDate><description><![CDATA[This is the hard version of the problem. The difference between the versions is that in the easy version all prices a_iai​ are different. You can make hacks if and only if you solved both versions of the problem.Today is Sage's birthday, and she will go sh]]></description><category></category></item><item><title><![CDATA[L - Median]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132740526</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132740526</guid><author>GF0919</author><pubDate>Thu, 07 Sep 2023 16:16:22 +0800</pubDate><description><![CDATA[题意：每一组数据给一个n，后面给n个数，求这些数之间的差绝对值的中位数，比如例子1 3 2 4 ，差为1，1，1，2，2，3，如果个数为偶数则取中间前面，奇数取中间的数。]]></description><category></category></item><item><title><![CDATA[Ban or Pick, What‘s the Trick]]></title><link>https://blog.youkuaiyun.com/GF0919/article/details/132716740</link><guid>https://blog.youkuaiyun.com/GF0919/article/details/132716740</guid><author>GF0919</author><pubDate>Wed, 06 Sep 2023 15:43:19 +0800</pubDate><description><![CDATA[【代码】Ban or Pick, What‘s the Trick。]]></description><category></category></item></channel></rss>