鍋囪瑕佸湪瓚沖澶氱殑浼氬満閲屽畨鎺掍竴鎵規椿鍔紝騫跺笇鏈涗嬌鐢ㄥ敖鍙兘灝戠殑浼氬満銆傝璁′竴涓湁鏁堢殑綆楁硶榪涜瀹夋帓銆?榪欎釜闂瀹為檯涓婃槸钁楀悕鐨勫浘鐫鑹查棶棰樸傝嫢灝嗘瘡涓涓椿鍔ㄤ綔涓哄浘鐨勪竴涓《鐐癸紝涓嶇浉瀹規椿鍔ㄩ棿鐢ㄨ竟鐩歌繛銆備嬌鐩擱偦欏剁偣鐫鏈変笉鍚岄鑹茬殑鏈灝忕潃鑹叉暟錛岀浉搴斾簬瑕佹壘鐨勬渶灝忎細鍦烘暟銆?
緙栫▼浠誨姟錛?
瀵逛簬緇欏畾鐨刱涓緟瀹夋帓鐨勬椿鍔紝緙栫▼璁＄畻浣跨敤鏈灝戜細鍦虹殑鏃墮棿琛ㄣ?/font>
Input
杈撳叆鏁版嵁鏄敱澶氱粍嫻嬭瘯鏁版嵁緇勬垚銆傛瘡緇勬祴璇曟暟鎹緭鍏ョ殑絎竴琛屾湁1 涓鏁存暟k錛岃〃紺烘湁k涓緟瀹夋帓鐨勬椿鍔ㄣ傛帴涓嬫潵鐨刱琛屼腑錛屾瘡琛屾湁2涓鏁存暟錛屽垎鍒〃紺簁涓緟瀹夋帓鐨勬椿鍔ㄥ紑濮嬫椂闂村拰緇撴潫鏃墮棿銆傛椂闂翠互0 鐐瑰紑濮嬬殑鍒嗛挓璁°?/font>
Output
瀵瑰簲姣忕粍杈撳叆錛岃緭鍑虹殑姣忚鏄綆楀嚭鐨勬渶灝戜細鍦烘暟銆?/font>
Sample Input
5
1 23
12 28
25 35
27 80
36 50
Sample Output
3
#include<iostream>#include<queue>using namespace std;struct Node
{
int s; int e; friend bool operator <(Node a,Node b)
{ return a.e > b.e;
}
};int main(){ int n; while(cin>>n) { int *hash = new int[n+1]; int t=0,i,maxe,index; Node p; priority_queue<Node>Q; for(i=0;i<n;i++) { scanf("%d%d",&p.s,&p.e); Q.push(p); } p = Q.top(); Q.pop(); hash[t++] = p.e; while(!Q.empty()) { p = Q.top(); Q.pop(); maxe = 0; index = 0; for(i=0 ;i<t;i++) { if(p.s >= hash[i] && maxe < hash[i]) { maxe = hash[i]; index = i; } } if(maxe == 0) hash[t++] = p.e; else hash[index] = p.e; } cout<<t<<endl; delete []hash; } return 0;}
緇欏畾n縐嶇墿鍝佸拰涓涓儗鍖呫傜墿鍝乮鐨勯噸閲忔槸Wi錛屽叾浠峰間負Vi錛岃儗鍖呯殑瀹歸噺涓篊銆傚簲濡備綍閫夋嫨瑁呭叆鑳屽寘鐨勭墿鍝侊紝浣垮緱瑁呭叆鑳屽寘涓墿鍝佺殑鎬諱環鍊兼渶澶?鍦ㄩ夋嫨鐗╁搧i瑁呭叆鑳屽寘鏃訛紝鍙互閫夋嫨鐗╁搧i鐨勪竴閮ㄥ垎錛岃屼笉涓瀹氳鍏ㄩ儴瑁呭叆鑳屽寘錛?≤i≤n銆?
緙栫▼浠誨姟錛?
瀵逛簬緇欏畾鐨刵縐嶇墿鍝佸拰涓涓儗鍖呭閲廋錛岀紪紼嬭綆楄鍏ヨ儗鍖呬腑鏈澶х殑鐗╁搧鎬諱環鍊箋?/font>
Input
杈撳叆鐢卞緇勬祴璇曟暟鎹粍鎴愩?
姣忕粍嫻嬭瘯鏁版嵁杈撳叆鐨勭1琛屼腑鏈?涓鏁存暟n鍜孋銆傛鏁存暟n鏄墿鍝佷釜鏁幫紱姝ｆ暣鏁癈鏄儗鍖呯殑瀹歸噺銆傛帴涓嬫潵鐨?琛屼腑錛岀涓琛屾湁n涓鏁存暟錛屽垎鍒〃紺簄涓墿鍝佺殑閲嶉噺錛屽畠浠箣闂寸敤絀烘牸鍒嗛殧錛涚浜岃鏈塶涓鏁存暟錛屽垎鍒〃紺簄涓墿鍝佺殑浠峰鹼紝瀹冧滑涔嬮棿鐢ㄧ┖鏍煎垎闅斻?/font>
Output
瀵瑰簲姣忕粍杈撳叆錛岃緭鍑虹殑姣忚鏄綆楀嚭鐨勮鍏ヨ儗鍖呬腑鏈澶х殑鐗╁搧鎬諱環鍊鹼紝淇濈暀涓浣嶆湁鏁堟暟瀛椼?/font>
Sample Input
3 50
10 20 30
60 100 120
Sample Output
240.0
#include<iostream>#include<stdio.h>#include<algorithm>using namespace std;struct Node { double weight; double value; };bool comp (Node a,Node b){ return a.value/a.weight > b.value/b.weight;}int main(){ int n,i; double c,w,v; while(scanf("%d%lf",&n,&c)!=EOF) { Node infor[2001]; for(i=0;i<n;i++) scanf("%lf",&infor[i].weight); for(i=0;i<n;i++) scanf("%lf",&infor[i].value); sort(infor,infor+n,comp); v = 0.0; w = 0.0; for(i=0;i<n;i++) { if(infor[i].weight + w <= c) { w += infor[i].weight; v += infor[i].value; } else { v+=(c-w)/infor[i].weight * infor[i].value; break; } } printf("%.1lf\n",v); } return 0;}
Total Submit:76 Accepted:38
Description
鍋囪瑕佸湪瓚沖澶氱殑浼氬満閲屽畨鎺掍竴鎵規椿鍔紝騫跺笇鏈涗嬌鐢ㄥ敖鍙兘灝戠殑浼氬満銆傝璁′竴涓湁鏁堢殑綆楁硶榪涜瀹夋帓銆?榪欎釜闂瀹為檯涓婃槸钁楀悕鐨勫浘鐫鑹查棶棰樸傝嫢灝嗘瘡涓涓椿鍔ㄤ綔涓哄浘鐨勪竴涓《鐐癸紝涓嶇浉瀹規椿鍔ㄩ棿鐢ㄨ竟鐩歌繛銆備嬌鐩擱偦欏剁偣鐫鏈変笉鍚岄鑹茬殑鏈灝忕潃鑹叉暟錛岀浉搴斾簬瑕佹壘鐨勬渶灝忎細鍦烘暟銆?
緙栫▼浠誨姟錛?
瀵逛簬緇欏畾鐨刱涓緟瀹夋帓鐨勬椿鍔紝緙栫▼璁＄畻浣跨敤鏈灝戜細鍦虹殑鏃墮棿琛ㄣ?/font>
Input
杈撳叆鏁版嵁鏄敱澶氱粍嫻嬭瘯鏁版嵁緇勬垚銆傛瘡緇勬祴璇曟暟鎹緭鍏ョ殑絎竴琛屾湁1 涓鏁存暟k錛岃〃紺烘湁k涓緟瀹夋帓鐨勬椿鍔ㄣ傛帴涓嬫潵鐨刱琛屼腑錛屾瘡琛屾湁2涓鏁存暟錛屽垎鍒〃紺簁涓緟瀹夋帓鐨勬椿鍔ㄥ紑濮嬫椂闂村拰緇撴潫鏃墮棿銆傛椂闂翠互0 鐐瑰紑濮嬬殑鍒嗛挓璁°?/font>
Output
瀵瑰簲姣忕粍杈撳叆錛岃緭鍑虹殑姣忚鏄綆楀嚭鐨勬渶灝戜細鍦烘暟銆?/font>
Sample Input
5
1 23
12 28
25 35
27 80
36 50
Sample Output
3
#include<iostream>#include<queue>using namespace std;struct Node{ int s; int e; friend bool operator <(Node a,Node b) { return a.e > b.e; }};int main(){ int n; while(cin>>n) { int *hash = new int[n+1]; int t=0,i,maxe,index; Node p; priority_queue<Node>Q; for(i=0;i<n;i++) { scanf("%d%d",&p.s,&p.e); Q.push(p); } p = Q.top(); Q.pop(); hash[t++] = p.e; while(!Q.empty()) { p = Q.top(); Q.pop(); maxe = 0; index = 0; for(i=0 ;i<t;i++) { if(p.s >= hash[i] && maxe < hash[i]) { maxe = hash[i]; index = i; } } if(maxe == 0) hash[t++] = p.e; else hash[index] = p.e; } cout<<t<<endl; delete []hash; } return 0;}]]>
#include<iostream>#include<algorithm>using namespace std;bool comp(int a,int b){ return a>b;}int main(){ int n; while(cin>>n && n) { int ts,te,ks,ke,i,wins,loses; int tj[1001],king[1001]; for(i=1;i<=n;i++) scanf("%d",&tj[i]); for(i=1;i<=n;i++) scanf("%d",&king[i]); sort(tj+1,tj+n+1,comp); sort(king+1,king+n+1,comp); ts = ks = 1; te = ke = n; wins = loses = 0; while(1) { if(ts > te || ks > ke) break; if(tj[ts] > king[ks]) //鏈蹇殑璧簡 { ts++; ks++; wins++; continue; } else if(tj[ts] < king[ks])//鏈蹇殑杈撲簡 { te--; ks++; loses++; continue; } if(tj[te] > king[ke]) //鏈鎱㈢殑璧簡 { te--; ke--; wins++; continue; } else if(tj[te] < king[ke])//鏈鎱㈢殑杈撲簡 { te--; ks++; loses++; continue; } if(tj[te] < king[ks]) //鏈鎱笌鏈蹇?/span> loses++; te--; ks++; } cout<<200*(wins-loses)<<endl; } return 0;}
]]>
#include<iostream>#include<algorithm>using namespace std;struct Node{ int st;//鎬繪槸淇濆瓨灝忕殑 int et;//鎬繪槸淇濆瓨澶х殑};bool comp(Node a,Node b){ if(a.st == b.st) return a.et<b.et; else return a.st<b.st;}Node infor[201];int main(){ int cas,n; cin>>cas; while(cas--) { cin>>n; int i,j,k,a,b; int hash[201]; for(i=0;i<n;i++) { cin>>a>>b; infor[i].st=a<b?a:b; infor[i].et=a>b?a:b; } sort(infor,infor+n,comp); k=0; hash[k++]=infor[0].et; for(i=1;i<n;i++) { for(j=0;j<k;j++) { if(hash[j]<infor[i].st) { if(hash[j]%2==1 )//濂囨暟鏃惰鑰冭檻娓呮 { /**//* 3 5 7 4 6 8 4->5 銆?->7闇瑕?0鍒嗛挓 */ if( infor[i].st - hash[j] > 1) { hash[j] = infor[i].et; break; } } else { hash[j] = infor[i].et; break; } } } if(j==k) hash[k++] = infor[i].et; } cout<<k*10<<endl; } return 0;}]]>
#include<iostream>#include<algorithm>using namespace std;struct Node{ int s; int e; int v;};bool comp(Node a,Node b){ return a.e < b.e;}int main(){ int n; while(cin>>n && n) { int i,en; Node infor[1001]; for(i=1;i<=n;i++) { scanf("%d%d",&infor[i].s,&infor[i].e); infor[i].v = i; } sort(infor+1,infor+n+1,comp); cout<<infor[1].v; en = infor[1].e;//緇撴潫浣嶇疆 for(i=2;i<=n;i++) { if(en < infor[i].s) { cout<<" "<<infor[i].v; en = infor[i].e; } } cout<<endl; } return 0;}]]>
//璐績#include<iostream>#include<algorithm>using namespace std;struct Node{ int len; int wei;};bool comp(Node a,Node b){ if(a.len!=b.len) return a.len>b.len; else return a.wei>b.wei;}int main(){ int n,t; cin>>t; while(t--) { Node infor[5001]; int i,j,t,hash[5001],max,minj; cin>>n; for(i=1;i<=n;i++) scanf("%d%d",&infor[i].len,&infor[i].wei); sort(infor+1,infor+n+1,comp); hash[0] = infor[1].wei; t=1; for(i=2;i<=n;i++) { max = 10001; for(j=0;j<t;j++) { if(infor[i].wei<=hash[j] && hash[j]-infor[i].wei < max) { max = hash[j]-infor[i].wei; minj = j; } } if(max == 10001) { hash[t++]=infor[i].wei; continue; } hash[minj] = infor[i].wei; } cout<<t<<endl; } return 0;}]]>