- 博客(17)
- 收藏
- 关注
RSS订阅原创 1099. Build A Binary Search Tree (30)
#include#include#include#include#includeusing namespace std;int n;vector ans;struct node{ int lchild,rchild; int num;}nodes[105];int f(int x){ if(x==-1) return 0; return f(nodes[x].l
2016-08-29 14:39:45
377
原创 1098. Insertion or Heap Sort (25)
#include#include#include#includeusing namespace std;int n;vector a,b,c;bool Ins(){ bool flag=false; for(int i=1;i<n;i++) { int t=c[i]; for(int j=i;j>0;j--) { if(c[j]<c[j-1]) sw
2016-08-25 22:00:56
184
原创 1097. Deduplication on a Linked List (25)
#include#include#include#include#includeusing namespace std;struct node{ int date; int next;}nodes[100001];int f[100001];int main(){ int s,n; cin>>s>>n; int a,date,b; for(int i=0;i<n;
2016-08-15 14:08:22
168
原创 1096. Consecutive Factors (20)
#include#include#include#includeusing namespace std;int main(){ int n; cin>>n; int maxn=0; vector res,factor; for(int i=2;i<=(int)sqrt(n);i++) { int j=i,z=n,x=0; factor.clear(); whi
2016-08-13 14:30:01
133
原创 1095. Cars on Campus (30)
有一个case超时#include#include#include#include#include#includeusing namespace std;map c2id;map id2c;struct node{ int time,in_out,id; node(int a,int b,int c):time(a),in_out(b),id(c){}};stru
2016-08-12 15:10:46
165
原创 1094. The Largest Generation (25)
#include#include#includeusing namespace std;vector ger[105];int n, m;int gerlevel[105],maxlevel=0,maxlevelnum=0;void dfs(int x,int level){ gerlevel[level]++; if(maxlevelnum<gerlevel[level])
2016-08-11 12:20:20
141
原创 1093. Count PAT's (25)
#include#include#includeusing namespace std;#define ll long longint main(){ string str; cin>>str; ll p,pa,pat; p=pa=pat=0; for(int i=0;str[i];i++) { if(str[i]=='P') p++; else if(str[
2016-08-10 11:34:05
120
原创 1092. To Buy or Not to Buy (20)
#include#include#includeusing namespace std;int f[251];int main(){ string a,b; cin>>a>>b; for(int i=0;a[i];i++) f[a[i]]++; int loss=0; for(int i=0;b[i];i++) { if(f[b[i]]>0) f[b[i]]--
2016-08-09 12:03:47
128
原创 1091. Acute Stroke (30)
参考的代码#include#include#includeusing namespace std;int n,m,l,t;int sum=0;int map[1500][200][100];int dx[6] = {1,-1,0,0,0,0}; int dy[6] = {0,0,1,-1,0,0}; int dz[6] = {0,0,0,0,1,-1}; struct n
2016-08-08 10:14:16
175
原创 1090. Highest Price in Supply Chain (25)
#include#include#include#includeusing namespace std;int n,root;double p,r;vector child[100005];int ran[100005],vis[100005];void dfs(int x){ for(int i=0;i<child[x].size();i++) { int h=ch
2016-08-07 16:15:12
133
原创 1088. Rational Arithmetic (20)
#include#include#includeusing namespace std; #define ll long longll gcd(ll a,ll b){ if(b==0) return a; return gcd(b,a%b);}void output(ll a,ll b){ ll f=gcd(a,b); if(b==0) { cou
2016-08-04 22:26:59
172
原创 1089. Insert or Merge (25)
#include#include#includeusing namespace std;int n;int a[105],b[105],c[105],d[105];bool ins(){int i,j;bool flag=false;for(i=1;i{int t=a[i]; for(j=i;j>0;j--){if(c[j-1]>t)
2016-08-04 22:08:45
171
原创 PAT1087
#include#include#include #include#include #includeusing namespace std;#define inf 0x3f3f3f3fmap tran; map tran2;int mincost=inf,num=0,hap=0;int avghap=0;int h[205];int cost
2016-08-02 11:31:38
211
原创 PAT1086
#include#include#include#include#include#includeusing namespace std;vector pre,in;queue que;bool flag=false;void build(int pl,int pr,int il,int ir){if(pl>pr) return;int p=
2016-08-01 18:57:13
384
原创 PAT1085
#include#include#include#include#define ll long longusing namespace std; vector ans;int n,p;int bearch(ll x){int l=0,r=n-1;while(l{int m=(l+r)/2;if(ans[m]==x)return m;
2016-07-29 10:22:13
151
原创 PAT1084
#include#include#include#includeusing namespace std;int main(){string a,b;cin>>a>>b;int flag[300];memset(flag,false,sizeof flag);for(int i=0;b[i];i++){if(b[i]>='a'&&b[i]fla
2016-07-28 14:01:53
203
原创 PAT1083
#include#include#include#include#includeusing namespace std;struct node{string name;string Id;int grade;};bool cmp(node a,node b){return a.grade>b.grade;}int main(){
2016-07-27 11:16:41
219
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人