Articles in the category of 算法

北京理工大学2019年计算机学院小学期程序设计方法与实践 - 热身赛题解

Problem A. A + B ProblemI don't know I need to say what. But I know there are many teams using BigInteger. They get Time Limit Exceeded and some people get Wrong Answer or Runtime Error because the...

xzm2019

August 15, 2019

No comments

Beijing Institute of Technology 2019.6 Monthly Contest 题解

A. Radishes如果$n\leq 40$，我们可以进行暴力求解，复杂度$O(n^2)$然而如果$n>40$，根据抽屉原理，必定至少有一个$l_i$出现了两边，此时$|l_i-l_j|=0,\ d=0$。我们只要统计每一个数前两次的位置，将最多40个答案进行排序，即可。#include <iostream> #include <vector> #includ...

xzm2019

June 27, 2019

No comments

2019 西安邀请赛D Miku and Generals

把冲突关系合并成点，然后dp即可。#include <bits/stdc++.h> using namespace std; const int zero = 200 * 500; int dp[205][zero * 2 + 5]; vector<int> G[205]; int a[205]; bool vist[205]; vector<int> ...

xzm2019

May 29, 2019

No comments

lintcode 384. 最长无重复字符的子串

给定一个字符串，请找出其中无重复字符的最长子字符串。问题分析暴力我们拿到问题，如果一时间想不到正解，可以先想想暴力的做法，再一步一步优化。最暴力的做法是：枚举这个子串的起始点st和终止点en，然后扫一遍这个子串判断里面有没有重复的字符。如果这个子串中没有重复字符，说明该子串合法，我们就取当前的长度en - st + 1，和当前答案取最大值max。class Solution { public...

xzm2019

May 28, 2019

No comments

第十三届北邮校赛（2019）个人存档

仅为个人存档~SolvedABCDEFGHIJKLM8/13OO.OO..OO.O.OO for passing during the contestØ for passing after the contest! for attempted but failed· for having not attempted yetA. Sequence (xzm2019, 0:06, +2)其实题目...

xzm2019

April 22, 2019

1 comments