经典例题
文章平均质量分 78
红鲤鱼遇绿鲤鱼
只要思想不滑坡,办法总比困难多~
展开
-
洛谷 P4516 潜入行动
原题:外星人又双叒叕要攻打地球了,外星母舰已经向地球航行!这一次,JYY 已经联系好了黄金舰队,打算联合所有 JSOIer 抵御外星人的进攻。在黄金舰队就位之前,JYY 打算事先了解外星人的进攻计划。现在,携带了监听设备的特工已经秘密潜入了外星人的母舰,准备对外星人的通信实施监听。外星人的母舰可以看成是一棵 n 个节点、 n−1 条边的无向树,树上的节点用 1,2,⋯ ,n 编号。JYY 的特工已经装备了隐形模块,可以在外星人母舰中不受限制地活动,可以神不知鬼不觉地在节点上安装监听设备。如果在节点原创 2021-08-07 00:28:14 · 150 阅读 · 0 评论 -
洛谷 P2014 选课
原题:题目描述在大学里每个学生,为了达到一定的学分,必须从很多课程里选择一些课程来学习,在课程里有些课程必须在某些课程之前学习,如高等数学总是在其它课程之前学习。现在有 N 门功课,每门课有个学分,每门课有一门或没有直接先修课(若课程 a 是课程 b 的先修课即只有学完了课程 a,才能学习课程 b)。一个学生要从这些课程里选择 M 门课程学习,问他能获得的最大学分是多少?输入格式第一行有两个整数 N , M 用空格隔开。( 1≤N≤300 , 1≤M≤300 )接下来的 N 行,第 I+1 行包含原创 2021-07-30 21:22:07 · 206 阅读 · 0 评论 -
hdoj 2196 Computer
原题:A school bought the first computer some time ago(so this computer’s id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Managers of school are anxious about slow functioning原创 2021-06-13 09:42:29 · 158 阅读 · 0 评论 -
洛谷 P2571 [SCOI2010]传送带
原题:题目描述在一个 222 维平面上有两条传送带,每一条传送带可以看成是一条线段。两条传送带分别为线段 AB\text{AB}AB 和线段 CD\text{CD}CD。lxhgww 在 AB\text{AB}AB 上的移动速度为 PPP,在 CD\text{CD}CD 上的移动速度为 QQQ,在平面上的移动速度 RRR。现在 lxhgww 想从 A\text AA 点走到 D\text DD 点,他想知道最少需要走多长时间。输入格式第一行 444 个整数,表示 A\text AA 和 B\text原创 2021-02-14 12:48:17 · 335 阅读 · 0 评论 -
hdoj 2476 String painter
原题: There are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can change a segment of characters of a string to any other character you want.原创 2020-06-26 16:38:26 · 380 阅读 · 0 评论 -
uva 1331
原题:Triangulation of surfaces has applications in the Finite Element Method of solid mechanics. Theobjective is to estimate the stress and strain on complex objects by partitioning them into small si...原创 2020-02-23 01:21:19 · 268 阅读 · 0 评论 -
uva 1626
原题:Let us define a regular brackets sequence in the following way:1… Empty sequence is a regular sequence.2 …If S is a regular sequence, then (S) and [S] are both regular sequences.3…If A and B ar...原创 2020-01-26 23:29:08 · 257 阅读 · 0 评论 -
关于序列求和
最大子段和前缀和利用前缀和求解,计算前缀和sumsumsum,枚举区间[l,r][l,r][l,r],时间复杂度O(n^2)int maxSubArray(vector<int>& nums) { if(nums.empty()) return 0; vector<int> sum(nums.size(),0);...原创 2020-01-25 22:32:59 · 1537 阅读 · 0 评论 -
cf Educational Codeforces Round 78 C. Berry Jam
原题:C. Berry Jamtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKarlsson has recently discovered a huge stock of berry jam jars in the ba...原创 2020-01-11 14:07:01 · 408 阅读 · 0 评论 -
LA 4728 Squares
原题: The famous Korean IT company NHN plans to make a digital map of the Earth with help of wireless sensors which spread out in rough terrains. Each sensor sends a geographical data to NHN . But, due...原创 2018-04-01 15:57:39 · 270 阅读 · 0 评论 -
uva 11825 Hackers' Crackdown
原题: Miracle Corporations has a number of system services running in a distributed computer system which is a prime target for hackers. The system is basically a set of N computer nodes with each of ...原创 2018-04-22 17:46:47 · 586 阅读 · 0 评论 -
cf Educational Codeforces Round 40 E. Water Taps
原题:E. Water Taps time limit per test2 seconds memory limit per test256 megabytesinputstandard input outputstandard outputConsider a system of n water taps all pouring water into the same cont...原创 2018-06-20 22:58:13 · 342 阅读 · 0 评论 -
uva 1025 A Spy in the Metro
原题: Secret agent Maria was sent to Algorithms City to carry out an especially dangerous mission. After several thrilling events we find her in the first station of Algorithms City Metro, examining t...原创 2018-07-30 12:49:38 · 209 阅读 · 0 评论 -
uva 1347 Tour
原题: John Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places. To save money, John must determine the shortest closed tour that conne...原创 2018-08-12 01:55:16 · 277 阅读 · 0 评论 -
poj 3061 Subsequence & 3220 Jessica's Reading Problem
原题: Subsequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21135 Accepted: 9032 DescriptionA sequence of N positive integers (10 &lt; N &lt; 100 000), each of them le...原创 2018-09-01 12:43:44 · 265 阅读 · 0 评论 -
poj 3276 Face The Right Way
原题: Face The Right Way Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 6751 Accepted: 3141 DescriptionFarmer John has arranged his N (1 ≤ N ≤ 5,000) cows in a row and many of...原创 2018-09-02 19:17:58 · 187 阅读 · 0 评论 -
poj 3279 Fliptile
原题: Fliptile Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16726 Accepted: 6121 DescriptionFarmer John knows that an intellectually satisfied cow is a happy cow who will...原创 2018-09-06 16:43:00 · 226 阅读 · 0 评论 -
poj 2631 Roads in the North
原题:Roads in the NorthTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5309 Accepted: 2508DescriptionBuilding and maintaining roads among communities in the far North is an expensive bu...原创 2019-04-17 20:21:44 · 189 阅读 · 0 评论 -
poj 3255 Roadblocks
原题: Roadblocks Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 17423 Accepted: 6140 DescriptionBessie has moved to a small farm and sometimes enjoys returning to visit one...原创 2018-03-04 15:37:13 · 178 阅读 · 0 评论 -
poj 3061 Subsequence
原题: Subsequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18219 Accepted: 7791 DescriptionA sequence of N positive integers (10 < N < 100 000), each of them le...原创 2018-03-01 22:17:10 · 168 阅读 · 0 评论 -
uva 10817 Headmaster's Headache
uva 10817 Headmaster's Headache原创 2017-12-12 17:18:50 · 454 阅读 · 0 评论 -
状态压缩动态规划入门
状态压缩 动态规划转载 2016-02-29 10:39:01 · 2547 阅读 · 3 评论 -
uva 10670 The jackpot
uva 10684 The jackpot原创 2016-02-21 11:48:57 · 482 阅读 · 0 评论 -
uva 10245 The Closest Pair Problem
uva 10245 The Closest Pair Problem原创 2016-04-04 21:05:29 · 834 阅读 · 0 评论 -
poj 2785 4 Values whose Sum is 0
poj 2785 4 Values whose Sum is 0原创 2016-02-28 01:05:35 · 433 阅读 · 0 评论 -
hdoj 1698 Just a Hook
hdoj 1698 Just a Hook原创 2016-07-23 00:11:47 · 328 阅读 · 0 评论 -
POJ 2991 Crane
题目: Crane Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5449 Accepted: 1467 Special Judge DescriptionACM has bought a new crane (crane – jeřáb) . The crane consists of n原创 2016-07-17 17:47:27 · 379 阅读 · 0 评论 -
uva 524 Prime Ring Problem
uva 524 Prime Ring Problem原创 2016-08-19 22:28:18 · 495 阅读 · 0 评论 -
uva 673 Parentheses Balance
uva 673 Parentheses Balance原创 2016-08-25 13:55:20 · 623 阅读 · 0 评论 -
uva 439 Knight Moves
uva 439 Knight Moves原创 2016-08-25 23:14:13 · 451 阅读 · 0 评论 -
uva 11971 Polygon
uva 11971 Polygon原创 2016-09-27 19:11:59 · 455 阅读 · 0 评论 -
uva 165 Stamps
uva 165 Stamps 经典的连续邮资问题原创 2016-12-12 18:11:28 · 621 阅读 · 0 评论 -
uva 11997 K Smallest Sums
uva 11997 K Smallest Sums原创 2017-02-06 23:55:32 · 351 阅读 · 0 评论 -
LA 3027 Corporative Network
LA 3027 Corporative Network原创 2017-02-08 00:00:03 · 309 阅读 · 0 评论 -
uva 11134 Fabled Rooks
uva 11134 Fabled Rooks原创 2017-05-04 22:27:21 · 401 阅读 · 0 评论 -
uva 12096 The SetStack Computer
uva 12096 The SetStack Computer原创 2017-05-24 15:45:18 · 431 阅读 · 0 评论 -
cf Educational Codeforces Round 25 F. String Compression
Educational Codeforces Round 25F. String Compression原创 2017-08-28 13:17:04 · 476 阅读 · 0 评论 -
uva 1151 Buy or Build
uva 1151 Buy or Build原创 2017-10-02 19:37:16 · 323 阅读 · 0 评论 -
And Then There Was One ,Japan LA 3882
题目大意,n个数排成一个圈。第一次删除m,以后每k个数删除一次,求最后一个被删除的数。#include <bits/stdc++.h>using namespace std;const int maxn = 10000+2;int f[maxn];int main(){ ios::sync_with_stdio(false); int n,k,m; while(ci原创 2016-02-09 02:29:23 · 373 阅读 · 0 评论