ruojingzhang的博客

#include <stdio.h> #include <string.h> #include <algorithm> using namespace std; int a[250],vis[205],sum,l,n; int dfs(int x,int pos,int len) { if(x == 3)

题目链接＃＃＃题意解读理解冒泡排序的过程最左坐标值为当前坐标和最终坐标的最小值（）最右坐标值为当前坐标加右边较小数据的个数（每个比当前值小的右边的数据都会和当前值交换）树状数组从右往左扫，将当前值对应在数组中的位置更新为1，求比其小的数已经有几个存在。ps：描述不太严谨不想用数学公式咋办，还是看代码吧，理解就好。#include<iostream>#include<cstdio>#i

区间问题 暴力解法＋离线处理题目传送门：小Z的袜子#include <iostream>#include<cstring>#include<algorithm>#include<cmath>#include <cstdio>using namespace std;#define maxn 50010typedef long long ll;int n,m;int a[maxn]=

#include<iostream>#include<cstdio>#include<vector>#include<queue>#include<cstring>using namespace std;const int N=100010;vector<int> Tree[N];int d;int ans;int vis[N];void bfs(int u){ ans

HDU1556 Color the ballHDU1349 Minimum Inversion NumberHDU4417 Super Mario

set用法

#include<iostream>#include<bitset>#include<cstdio>#include<vector>#include<cstring>using namespace std;const int N=105;int mp[N][N];int du[N];int n,m,s;vector<int> R,RR;int result;void dfs(i

http://blog.163.com/lixiangqiu_9202/blog/static/53575037201251121331412/

#include<iostream>#include<cmath>#include<cstdio>using namespace std;typedef long long ll;ll power(ll a,ll n){ ll ans=1; while(n>0){ if(n&1) ans*=a; a=a*a;//a=a的 2的i次方 的次方

#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<cmath>using namespace std;bool dis[200010];int main(){ long long t,n,m; int x[700],y[700]; cin>>t; while

#include<iostream>#include<stdio.h>#include<string>#include<algorithm>using namespace std;int a[50005];//已知数组；int c[50005];//树状数组；int n; int lowBit(int x) //计算2^K的值，即下标为X的结点管辖的范围 {

#include<iostream>#include<cmath>#include<cstdio>using namespace std;int main(){ int t; double a,b,l,sl; double s; cin>>t; while(t--){ cin>>l>>a>>b; b=b<a?b:a;

先上俩链接，过后再来补题 题意理解加分类讨论 贪心

Description Kefa decided to celebrate his first big salary by going to the restaurant. He lives by an unusual park. The park is a rooted tree consisting of n vertices with the root at vertex 1.

关于昨晚的B题 正常说，水题，深搜或者并查集都能做 然而 是谁说过看了看数据觉得能做就敲代码了。要保存错误现场的代码#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<set>#include<algorithm>using namespace st

DescriptionWhen a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels used by each repea

B - Mike and Feet Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Description Mike is

题目链接题意最短路径 1–>n;多条路径情况下选择路径字典序最小的解题n–>1 bfs最短路 1–>n 满足最短路的条件下找最小颜色代码#include<iostream>#include<cstdio>#include<algorithm>#include<queue>#include<cstring>#include<vector>#define inf 0x3f3f3f3f

Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description For each three prime numbers p1, p2 and p3, let’s define Hamming sequence Hi(p1, p2,

流水账11月11日出行，两支队伍一起去北京，也没什么好说的，我们先到站上车，后来他们也到了。上午走，下午到，然后找宾馆入住。晚饭六个人一起披萨自助，拍了照也不想传图。第二天上午要去北大报道（PS：反正是游客身份进北大清华不是第一次了，不像某昱学长考进清华前绝不以游客身份进清华），所以前一晚和男生们约了第二天九点出门吃早饭去北大报道。结果是第二天去敲门的时候还有俩没醒，ok好吧，然后我们就出门