Roly

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1004   #include #include #include #include using namespace std; int main(){     int n;     string str;     while(cin>>n&&n){         mapstring,

http://acm.hit.edu.cn/hoj/problem/view?id=1999 #include #include #include #include #include using namespace std; string str; priority_queueint> q; int main(){     cin.sync_with_stdio(fals

/* 判断如果k比连续子数组和的最大值还大，比最小值还小，那么肯定无解了，直接输出No */ #include #include using namespace std; const int maxn = 10005; int a[maxn]; int b[maxn]; int main(){ int n; while(~scanf("%d",&n)){

思路： 先求P-L的因子

The kth great number Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65768/65768K (Java/Other) Total Submission(s) : 26 Accepted Submission(s) : 9 Problem Description Xiao Ming and Xiao Bao are p

#include #include #include #include #include #include #include using namespace std; const int maxn = 10005; struct stop{ int d,f; friend bool operator<(const stop &a,const stop &b){