codeforces dp 1300分题起
冲dp
卐邾翊
能不能拿个牌?
展开
-
1388C. Uncle Bogdan and Country Happiness
C. Uncle Bogdan and Country Happiness纯纯DFS#include <bits/stdc++.h>using namespace std;const int N = 1e5 + 3;#define int long longint a[N], b[N], c[N];vector<int> cun[N];int vis[N];int ff = 1;void DFS(int x){ int res = 0; int原创 2022-03-17 00:47:51 · 187 阅读 · 0 评论 -
1476D. Journey
D. Journey一道简单线性dp#include <bits/stdc++.h>using namespace std;const int N = 5e5 + 3;char str[N];int a[N],b[N];int main(){ int t; cin>>t; while (t--) { int n; cin>>n; cin>>str+1;原创 2022-03-16 14:00:38 · 165 阅读 · 0 评论 -
D. Flowers
D. Flowers一个简单线性dp#include <bits/stdc++.h>using namespace std;#define int long longconst int mod = 1e9 + 7;int a[(int)2e6];signed main(){ int t, k; cin >> t >> k; a[0] = 1; for (int i = 1; i <= 1e5 + 5; i++)原创 2022-03-15 13:34:54 · 135 阅读 · 0 评论 -
B. File List
174B. File List:题目可恶啊,写了一堆bug,最讨厌字符串处理了(〃>目<)#include <bits/stdc++.h>using namespace std;// #define int long longstring s, ss = "";vector<string> ve;signed main(){ // freopen("input.txt","r",stdin); // freopen("output.txt","w",原创 2022-03-03 04:03:02 · 72 阅读 · 0 评论 -
E. Anfisa the Monkey
44E. Anfisa the Monkey老题目,不更新,不值1400分,建议减分#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c[(int)6e5];const int mod = 1e9 + 7;string s;signed main(){ int n,a原创 2022-03-03 02:21:43 · 95 阅读 · 0 评论 -
180C. Letter
C. Letter:题目#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c[(int)6e5];const int mod = 1e9 + 7;string s;signed main(){ cin>>s; int n = s.length();原创 2022-03-03 02:13:25 · 68 阅读 · 0 评论 -
359B. Permutation
B. Permutation:题目很容易就发现,按顺序正好等于0。把i和i+2换一次可以加2,所以k是多少就换几次#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c[(int)6e5];const int mod = 1e9 + 7;signed main(){ in原创 2022-03-03 02:08:12 · 105 阅读 · 0 评论 -
548B. Mike and Fun
B. Mike and Fun:题目太离谱了呀,这啥遍历题啊。。。#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c[(int)6e5];const int mod = 1e9 + 7;int g[1001][1001];signed main(){ int n,m原创 2022-03-03 01:51:46 · 61 阅读 · 0 评论 -
940B. Our Tanya is Crying Out Loud
B. Our Tanya is Crying Out Loud;题目1特判,因为除1还是本身,这点就很淦#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c[(int)6e5];const int mod = 1e9 + 7;signed main(){ int n,原创 2022-03-03 01:20:50 · 90 阅读 · 0 评论 -
253B. Physics Practical
B. Physics Practical:题目太简单的题目了,和dp没啥关系#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c[(int)6e5];const int mod = 1e9 + 7;signed main(){ freopen("input.txt","r",原创 2022-03-03 00:58:30 · 115 阅读 · 0 评论 -
797B. Odd sum
B. Odd sum:题目一道小小的贪心#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c[(int)6e5];const int mod = 1e9 + 7;string s;multiset<int> se;signed main(){ int n原创 2022-03-03 00:05:38 · 71 阅读 · 0 评论 -
602B. Approximating a Constant Range
B. Approximating a Constant Range:题目可恶啊,不知道为什么我双指针的代码不过,重新写了个。。。。。#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c[(int)6e5];const int mod = 1e9 + 7;string s;mul原创 2022-03-03 00:05:43 · 66 阅读 · 0 评论 -
1415C. Bouncing Ball
C. Bouncing Ball:题目很好的dp,1400分难见的题#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c[(int)6e5];const int mod = 1e9 + 7;string s;signed main(){ int t; cin原创 2022-03-03 00:05:44 · 91 阅读 · 0 评论 -
1189C. Candies
C. Candies:题目思维题,我是笨蛋。我看了半天也没想明白怎么dp,可恶啊。#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;signed main(){ int n; cin>原创 2022-03-02 18:13:31 · 178 阅读 · 0 评论 -
505B. Mr. Kitayuta‘s Colorful Graph
B. Mr. Kitayuta’s Colorful Graph:题目一开始就像到了DFS,并查集也不难想到。弗洛伊德算法倒是不容易想到,平时不这么用。。。。。#include <bits/stdc++.h>using namespace std;#define int long long// vector<int> a((int)6e5);// vector<int> b((int)6e5), c((int)6e5);const int mod = 1原创 2022-03-02 17:06:54 · 64 阅读 · 0 评论 -
1284B. New Year and Ascent Sequence
B. New Year and Ascent Sequence:题目小小思维题#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;signed main(){ int t; cin>&g原创 2022-03-02 16:34:32 · 74 阅读 · 0 评论 -
1282B1. K for the Price of One (Easy Version)
B1. K for the Price of One (Easy Version):题目两种情况,前面取一或者前面不取#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;string s;signed mai原创 2022-03-02 01:48:02 · 57 阅读 · 0 评论 -
1215B. The Number of Products
B. The Number of Products:题目#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);signed main(){ int n; cin>>n; for (int i=1;i<=n;i++) cin>>a[i]; vector<int>dp(3);原创 2022-03-02 01:32:06 · 112 阅读 · 0 评论 -
1276A. As Simple as One and Two
A. As Simple as One and Two:题目思路:删去中间#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;string s;signed main(){ int t; c原创 2022-03-02 01:20:19 · 90 阅读 · 0 评论 -
987C. Three displays
C. Three displays:题目#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;int sum[3333][4];signed main(){ int n; cin >>原创 2022-03-02 00:02:59 · 127 阅读 · 0 评论 -
1461B. Find the Spruce
B. Find the Spruce:题目题意:找有多少树状结构。思路:递推,从下往上算树尖。#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;char ch[555][555];int sum[555]原创 2022-03-02 00:02:56 · 108 阅读 · 0 评论 -
1535C. Unstable String
C. Unstable String题目每个?只能选择变一次,然后不能变了,这是关键。#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;int mp1[30],mp2[30];string str;sig原创 2022-03-02 00:02:54 · 156 阅读 · 0 评论 -
1451C. String Equality
C. String Equality:题目我也不知道这算不算dp....虽然它有一个dp的标签#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;int mp1[30],mp2[30];string str1原创 2022-03-02 00:02:51 · 94 阅读 · 0 评论 -
1108D. Diverse Garland
D. Diverse Garland:题目什么脑瘫题目!!!可恶,和dp有什么关系?但是强迫症让我不得不写,空一个很难受!!#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;map<int, int&g原创 2022-03-01 19:19:02 · 117 阅读 · 0 评论 -
1245C. Constanze‘s Machine
C. Constanze’s Machine:题目众所周知,斐波那契数列属于dp#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;map<int, int> mp1, mp2;string st原创 2022-03-01 18:53:35 · 137 阅读 · 0 评论 -
1320A. Journey Planning
A. Journey Planning:题目mp的应用,和下标同样的差一定会越来越大,知道这点就好写了。#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;map<int,int>mp1,mp2;原创 2022-03-01 18:24:37 · 102 阅读 · 0 评论 -
289B. Polo the Penguin and Matrix
B. Polo the Penguin and Matrix:题目思路:纯暴力#include <bits/stdc++.h>using namespace std;// #define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;int g[111][111];signed main(){原创 2022-03-01 17:34:29 · 109 阅读 · 0 评论 -
538B. Quasi Binary
B. Quasi Binary:题目这题目建议挪到1000分,它不配1400#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;signed main(){ string str; cin &原创 2022-03-01 17:09:39 · 81 阅读 · 0 评论 -
1380C. Create The Teams
C. Create The Teams:题目正常人都会用dp吗?不应该是道贪心题吗?#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;signed main(){ int t; cin>原创 2022-03-01 16:41:17 · 124 阅读 · 0 评论 -
B. Mashmokh and ACM
414B. Mashmokh and ACM:题目1400分就进入经典dp了题意:给你1-n的数,构造一个长度为k的串,后一个数能整除前一个数#include <bits/stdc++.h>using namespace std;#define int long longvector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);const int mod = 1e9 + 7;signed原创 2022-03-01 16:06:10 · 114 阅读 · 0 评论 -
1350B. Orac and Models
B. Orac and Models:题目题意:找一个最长的串,后一个下标可以整除前一个,并且a[i]<a[i+1]#include <bits/stdc++.h>using namespace std;typedef long long ll;vector<int> a((int)6e5);vector<int> b((int)6e5), c((int)6e5);int dp[(int)5e5];int main(){ int t;原创 2022-03-01 15:43:28 · 117 阅读 · 0 评论 -
1195C. Basketball Exercise
C. Basketball Exercise:题目经典简单dp,考虑前两天的就行#include <bits/stdc++.h>using namespace std;typedef long long ll;vector<int> a((int)6e5);vector<int> b((int)6e5);ll dp[(int)5e5][3];int main(){ int n; cin>>n; for (int i=原创 2022-03-01 15:23:47 · 128 阅读 · 0 评论 -
1526B. I Hate 1111
B. I Hate 1111:题目这题目太搞了呀,和dp感觉关系不大,数学题啊首先要知道,11和111能构成后面所有的棍子数。n = a*111+b*11;最快做法//算是规律?#include <bits/stdc++.h>using namespace std;int main(){ int t; cin>>t; while (t--) { int n; cin>>n;原创 2022-03-01 00:18:32 · 141 阅读 · 0 评论 -
698A. Vacations
A. Vacations:题目题意:每天有四种可能性,锻炼和比赛分别两种可能性相乘。 不能连续锻炼或者连续比赛,问最少休息几天。思路:dp或者贪心都行。贪心写法#include <bits/stdc++.h>using namespace std;vector<int> a(111);int main(){ int n; cin >> n; for (int i = 1; i <= n; i++) {原创 2022-02-28 22:26:43 · 133 阅读 · 0 评论 -
653B. Bear and Compressing
B. Bear and Compressing:题目纯纯暴力DFS,和dp有啥关系!不想写了,copy一份,写的真精简。#include <bits/stdc++.h>using namespace std;int n, m;string a[40], b[40];int f[10][10][2];int dfs(int pos, int pre, int flag) { if (!pos)return flag; if (f[pos][pre][flag] != -1)r原创 2022-02-27 01:46:30 · 155 阅读 · 0 评论 -
234C. Weather
C. Weather:题目为什么直接交代码不行啊,非要加两句话,有没有大佬说说?#include <bits/stdc++.h>using namespace std;// typedef long long ll;vector<int> a((int)3e5);vector<int> b((int)3e5), c((int)3e5);int main(){ freopen("input.txt","r",stdin); freopen(原创 2022-02-27 01:39:04 · 113 阅读 · 0 评论 -
626B. Cards
B. Cards:题目竟然需要按照顺序输出,淦!#include <bits/stdc++.h>using namespace std;typedef long long ll;vector<ll> a((int)6e5);vector<ll> b((int)6e5);string str;int main(){ int a = 0, b = 0, c = 0; int n; cin >> n; cin &g原创 2022-02-27 01:17:34 · 61 阅读 · 0 评论 -
1040B. Shashlik Cooking
B. Shashlik Cooking:题目思路,如果所有烤肉都可以一次就行,如果不行就去前面调整一下#include <bits/stdc++.h>using namespace std;typedef long long ll;vector<ll> a((int)6e5);vector<ll> b((int)6e5);int main(){ int n,k; cin>>n>>k; if (!k)原创 2022-02-27 01:05:58 · 97 阅读 · 0 评论 -
870C. Maximum splitting
C. Maximum splitting:题目这凭啥1300分?#include <bits/stdc++.h>using namespace std;typedef long long ll;vector<ll> a((int)6e5);vector<ll> b((int)6e5);string str;int main(){ int t; cin>>t; while (t--) { int原创 2022-02-27 00:26:30 · 81 阅读 · 0 评论 -
1315B. Homecoming
B. Homecoming:题目思路:从后往前遍历就行了#include <bits/stdc++.h>using namespace std;typedef long long ll;vector<ll> a((int)6e5);vector<ll> b((int)6e5);string str;int main(){ int t; cin >> t; while (t--) { int a原创 2022-02-27 00:25:18 · 114 阅读 · 0 评论