cherish__lin

摘要： #include<bits/stdc++.h> // #include<iostream> // #include<stdio.h> // #include<iomanip> // #include<stack> // #include<queue> // #include<algorithm> // #include<cstring> // #include<map> // #include<v 阅读全文

摘要： Marge is already preparing for Christmas and bought a beautiful tree, decorated with shiny ornaments. Her Christmas tree can be represented as a compl 阅读全文

摘要： 题目链接:http://codeforces.com/gym/100553/attachments/download/2885/20142015-acmicpc-northeastern-european-regional-contest-neerc-14-en.pdf 首先bitset用法链接:h 阅读全文

摘要： 题目链接:http://codeforces.com/gym/101550/attachments 总的来说就是要: 极大值卖出,极小值买入, 再加上端点时的特判. 还有就是会有连续几天股票价格相同的情况,这里就是判断的时候是严格的大于小于号的功劳了 首先手里肯定是没有股票的, 尝试买入第一天的股票 阅读全文

摘要： Mr. Potato Head has been promoted and now is a math professor at the UNAL. For his first course he is willing to teach hard subjects, so at the moment 阅读全文

摘要： 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5531 Problem Description Archaeologists find ruins of Ancient ACM Civilization, and they want to rebuil 阅读全文

摘要： You are given a directed graph with 𝑛n vertices and 𝑚m directed edges without self-loops or multiple edges. Let's denote the 𝑘k-coloring of a digra 阅读全文

摘要： Almost everyone likes kebabs nowadays (Here a kebab means pieces of meat grilled on a long thin stick). Have you, however, considered about the hardsh 阅读全文

摘要： //高斯消元 时间复杂度O(n^3) 使用浮点数计算 #include #include #include using namespace std; const double eps=1e-8; const int maxn=101; double a[maxn][maxn]; bool l[maxn]; double ans[maxn]; int n,m; int t; void prin... 阅读全文

摘要： Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connected, undirected graph 阅读全文