上一页 1 ··· 48 49 50 51 52 53 54 55 56 ··· 63 下一页
摘要: https://www.acwing.com/problem/content/156/ 阅读全文
posted @ 2019-11-04 00:59 晴屿 阅读(177) 评论(0) 推荐(0)
摘要: https://www.acwing.com/problem/content/832/ 阅读全文
posted @ 2019-11-04 00:58 晴屿 阅读(180) 评论(0) 推荐(0)
摘要: https://www.acwing.com/problem/content/829/ 阅读全文
posted @ 2019-11-04 00:55 晴屿 阅读(157) 评论(0) 推荐(1)
摘要: https://www.acwing.com/activity/content/problem/content/863/1/ 阅读全文
posted @ 2019-11-04 00:54 晴屿 阅读(216) 评论(0) 推荐(0)
摘要: #include <iostream> #include <vector> #include <algorithm> using namespace std; typedef pair<int, int> PII; void merge(vector<PII> &segs) { vector<PII> res; sort(segs.begin(), segs.end());//pair排序会优先以 阅读全文
posted @ 2019-11-03 03:06 晴屿 阅读(143) 评论(0) 推荐(0)
摘要: #include<bits/stdc++.h> using namespace std ; int n; struct City { int id; long long x,y; //坐标 long long cc,kk; //自建的花费,连线的花费 bool self;//是否建站 int fa;//连线的站 bool operator < (const City & a)const { ret 阅读全文
posted @ 2019-11-02 23:38 晴屿 阅读(151) 评论(0) 推荐(0)
摘要: #include <bits/stdc++.h> using namespace std; typedef long long ll; char x[105]; char xx[105]; int main() { int t; cin>>t; while(t--) { int a,b,c,n; cin>>n>>a>>b>>c; for(int i=0; i<n; i++) xx[i]=0; sc 阅读全文
posted @ 2019-11-02 22:57 晴屿 阅读(294) 评论(0) 推荐(0)
摘要: #include<bits/stdc++.h> using namespace std; char s[101010]; int dp[101010]; const int MOD = 1e9+7; int main() { dp[0] = 1; scanf("%s", s+1); int N = strlen(s+1); for(int i=1; i<=N; ++i) { if(s[i] == 阅读全文
posted @ 2019-11-02 22:41 晴屿 阅读(233) 评论(0) 推荐(0)
摘要: https://www.acwing.com/problem/content/804/ 阅读全文
posted @ 2019-11-01 17:22 晴屿 阅读(319) 评论(0) 推荐(0)
摘要: https://www.luogu.org/problem/P1434 记忆化搜索 1. 2. 阅读全文
posted @ 2019-11-01 16:37 晴屿 阅读(119) 评论(0) 推荐(0)
上一页 1 ··· 48 49 50 51 52 53 54 55 56 ··· 63 下一页