一衍一

分类

cf补题(1) 区域赛真题练习(6) 未归档(44) 题解(71)

/ 注册

全部文章（共133篇）

tokitsukaze and Soldier

题解:贪心按s值从小到大排序,然后把每个士兵的v,s值压入优先队列每次压入优先队列时,判断压入当前元素需要删除之前多少个元素,因为压入是根据v从小到大压入的,所以得到的就是最大的,记得压入和删除的时候,求和,以及取max代码: #include<iostream> #include<...

2020-03-24

1 776

banzi

#include<bits/sdtc++.h>using namespace std;#define long long ll#define inf 1e18ll const maxn=2e6+10;struct node ///链式前向星存图{ ll to,next,val;///终点...

2020-02-17

0 583

Educational Codeforces Round 82 (Rated for Div. 2) C. Perfect Keyboard

题解:模拟 #include <bits/stdc++.h> using namespace std; #define sz(a) int((a).size()) #define all(a) (a).begin(), (a).end() #define forn(i,...

2020-02-17

0 547

Codeforces Round #619 (Div. 2) C. Ayoub's function

2020-02-17

0 557

Codeforces Round #620 (Div. 2) D. Shortest and Longest LIS

题解:直接构造 #include <bits/stdc++.h> using namespace std; const int MAX_N = 100; int t[MAX_N], lo[MAX_N], hi[MAX_N]; int main() { ...

2020-02-17

0 633

Codeforces Round #620 (Div. 2) C. Air Conditioner

题解:维护可以接受的区间 #include <bits/stdc++.h> using namespace std; const int MAX_N = 100; int t[MAX_N], lo[MAX_N], hi[MAX_N]; int main() { ...

2020-02-17

0 574

Educational Codeforces Round 46 (Rated for Div. 2) B. Light It Up

题意:求解一个最大的值,求法是可以在给定的序列内添加一个数字,来求值题解:dp,先算出n个区段的,然后dp模拟n个区段

2020-02-12

0 517

Codeforces Round #506 (Div. 3) B. Creating the Contest

题意:求一个最长的子序列,子序列满足,a(i)*2<=a(i) 题解:暴力....

2020-02-12

0 503

Codeforces Round #506 (Div. 3) A. Many Equal Substrings

题意:构建字符串,即复制字符串s,k次,如果后缀与前缀重复省略前缀题解:kmp板子next数组应用 #include<bits/stdc++.h> using namespace std; string s; int nex[1000]; int n,k; void ...

2020-02-12

0 558

2020牛客寒假算法基础集训营4 I题.匹配星星

题意:符合要求的星星有多少对题解:不会做,不过看完题解........排序,二分查找.......... #include <set> #include <vector> #include <iostream>...

2020-02-12

0 516