- 博客(8)
- 收藏
- 关注
RSS订阅原创 ccf 201312-5 I’m stuck!
#include<iostream>using namespace std;char s[55][55];int visited[55][55];int vis[55][55];char shang[8] = "+|TS";char xia[8]= "+|TS.";char zuo[8] = "+-TS";char you[8]= "+-TS";bool f(char cc[8],
2017-09-02 07:37:50
437
原创 ccf 201403-4 无线网络
#include<iostream>#include<vector>#include<deque>#include<cstring>#include<algorithm>using namespace std;struct node { long long int x, y; int len1[105], len2[105]; vector<int> ner;
2017-09-02 07:37:03
475
原创 ccf 201409-4 最优配餐
#include<iostream>#include<vector>using namespace std;struct node { int x, y; node(){x=0,y=0;} node(int a, int b) { x = a; y = b; }};int all[1005][1005];int cust[1005][1005];int vis[
2017-09-02 07:36:32
371
原创 ccf 201412-4 最优灌溉 100
#include<iostream>#include<algorithm>#include<vector>using namespace std;int pre[1005];class edge {public: int a, b, cost; bool operator<(const edge b)const { return cost < b.cost
2017-09-02 07:35:48
333
原创 ccf 201503-4 网络延时
#include<iostream>#include<vector>using namespace std;class node{ public: int h,_max; vector<int> son;}; node all[20005];int dfs(int index){ //if(!all[index].son) return 1
2017-09-02 07:35:05
344
原创 ccf 201509-4 高速公路
#include<iostream>#include<vector>#include<algorithm>using namespace std;int n, m;int sta[10005], index;int cnt;int vis[10005];int num, sum;;class node {public: vector<int> edge; int
2017-09-02 07:32:22
283
原创 ccf 201509-3 模板生成系统
#include<iostream>#include<string>#include<map>using namespace std;int m, n;map<string, string> AA;string all[105];int main() { cin >> m >> n; getchar(); for (int i = 0; i < m;++i) {
2017-09-02 07:31:36
310
原创 ccf 201512-4 送货
手动造递归#include<iostream>#include<vector>using namespace std;int n,m,cnt;vector<int> re; char arc[10001][10001];char ar[10001][10001];int v[10001];vector<int> all[10001];vector<int> rr;int vis[
2017-09-02 07:30:47
501
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人