1. 基本介绍MS1861 单颗芯片集成了HDMI、LVDS 和数字视频信号输入； 输出端可以驱动MIPI(DSI-2)、 LVDS 、Mini-LVDS 以及 TTL 类型 TFT-LCD 液晶显示。可支持对输入视频信号进行滤波，图 像增强， 锐化，&nb
原创
2023-05-20 14:07:01
1242阅读
Network
Time Limit: 1000MS
Memory Limit: 30000K
Total Submissions: 14976
Accepted: 5875
Special Judge
Description
Andrew is working as system administrator and is p
原创
2023-04-20 15:26:23
47阅读
#include <iostream> //kruskalusing namespace std;const int max_ve=1005,max_ed=15005;int n,m,i,flag[max_ed]; //n,m分别记录顶点数和边数struct node{ int par;}vertex[max_ve];struct Edge { int u,v,weigh;}edge[max_ed];int cmp(const void* a,const void* b){ return (*(Edge*)a).weigh-(*(Edge*)b).weigh;}int find_p
转载
2011-07-22 16:30:00
24阅读
2评论
NetworkTime Limit: 1000msMemory Limit: 30000KBThis problem will be judged onPKU. Original ID:186164-bit integer IO format:%lld Java class name:MainAnd...
转载
2014-11-20 19:38:00
47阅读
NetworkTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 10104Accepted: 3796Special JudgeDescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since
原创
2021-07-29 16:19:22
88阅读
最小生成树，由于是special judge 所以不用非得结果和样例一样View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>using namespace std;#define maxm 15005#define maxn 1005struct Edge{ int u, v, w;}edge[maxm], mst[maxm];int n, m, ecount, father[maxn
转载
2011-06-11 13:10:00
35阅读
2评论
// 596K 141MS G++#include #include #include using namespace std;struct Connetcions { int begin; int end; in b)
原创
2023-05-23 15:56:14
35阅读
DescriptionAndrew is working as system administrator and is planning to establish a new
原创
2023-04-24 07:34:30
44阅读
NetworkTime Limit:1000MSMemory Limit:30000KTotal Submissions:11372Accepted:4337Special JudgeDescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since eac
转载
2013-04-17 21:52:00
133阅读
2评论
刚开始用prim,,加pre[ ]的方法一直WA，后来改用这个方法，#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define N 150001struct
原创
2023-07-27 18:40:57
70阅读
忽略奇数偶数步，忽略胶水，就是一个一维dp，例如只能走1 2 4步，dp[n] = dp[n - 1] + dp[n - 2] + dp[n - 4] （当然要注意最后的台阶要单独处理 因为可以到负的层次） 加上奇数偶数步，那就是一个二维dp, dp[0][j]表示偶数步到i层，dp[1][i]表示 ...
转载
2021-04-23 15:17:00
56阅读
2评论
游船出租Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 3276
原创
2023-04-19 17:06:02
54阅读
游船出租 Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Problem Description 现有公园游船租赁处请你编写一个租船管理系统。当游客租船时，管理员输入船号并按下S键，系统
转载
2013-07-13 20:10:00
33阅读
#include #include #include #include #include #include #include #include #include #include using namespace std;#define LL long longconst doubl...
转载
2016-07-04 11:06:00
46阅读
题目：原题链接（中等）标签：数组、双指针解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N×M)O(N×M)O(N×M)O(N×M)O(N×M)O(N×M)500ms (41.82%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def rotateTheBox(self, box: List[List[str]]) -> List[List[str]]:
原创
2022-01-12 11:04:49
147阅读
题目：原题链接（中等）标签：数组、双指针解法时间复杂度空间复杂度执行用时Ans 1 (Python)O(N×M)O(N×M)O(N×M)O(N×M)O(N×M)O(N×M)500ms (41.82%)Ans 2 (Python)Ans 3 (Python)解法一：class Solution: def rotateTheBox(self, box: List[List[str]]) -> List[List[str]]:
原创
2021-08-26 10:34:50
169阅读
