/**//*
n<=10^5鍙猰ice錛宮<=10^5涓猚hese鍒嗗埆鍦ㄤ袱鏉℃按騫崇嚎涓?br> 姣忓彧鑰侀紶浼氶夋嫨紱誨畠鏈榪戠殑chese錛岀劧鍚庡悓鏃跺嚭鍙戯紝鑻ュ埌杈劇洰鏍囧榪樻湁chese錛屽氨浼氬悆錛堝嚑涓悓鏃跺埌杈劇殑涓璧峰悆錛?br> 鍚庢潵鐨勫氨娌℃湁浜?br> 鑻ユ湁澶氫釜錛屼細閫夋嫨浣挎渶鍚庣┖鑲氬瓙鐨刴ice鏁版渶灝戠殑閭ｅ潡chese 闂渶鍚庢湁澶氬皯鍙猰ice瑕佺┖鑲氬瓙 璐績 瀵規瘡鍙侀紶錛屽鎵捐窡瀹冩渶榪戠殑1涓垨2涓偣錛岃涓簂eft,right 濡傛灉left鐨刢hese榪樻病琚悆鎴栬呬箣鍓嶈侀紶鍒拌揪瀹冪殑鏃墮棿璺熷綋鍓嶈繖鍙竴鏍風殑璇濓紝璇ヨ侀紶涓嶄細楗胯倸瀛愪簡
濡傛灉涔嬪墠鐨勮侀紶杈懼埌瀹冪殑鏃墮棿姣斿綋鍓嶈繖鍙暱錛岃屼笖褰撳墠榪欏彧鑰侀紶鍙湁left榪欎釜鐐規渶榪戯紝閭ｅ緢鎶辨瓑錛屼箣鍓嶉偅鍙侀紶娌″緱鍚冧簡錛?br> 緇欒繖鍙侀紶鍚冧簡 鍚﹀垯錛堝嵆鏈変袱涓渶榪戠偣錛夛紝閫夋嫨鍙寵竟鐨刢hese 錛堣椽蹇冮夊乏杈圭殑錛屽鏋滃乏杈硅浜哄崰浜嗭紝鐪嬭兘涓嶈兘鍚冨彸杈圭殑錛屼笉鑳界殑璇濓紝鍙ソ璺熷乏杈圭殑绔炰簤浜嗭紝鐪嬭皝蹇級 O(N+M) 3 1 1 0 --> 2 1 4 5 3 3 3 1 0 --> 0 -6 -4 -1 -6 -2 0 
*/
#include<iostream>#include<cstring>#include<map>#include<algorithm>#include<stack>#include<queue>#include<cmath>#include<string>#include<cstdlib>#include<vector>#include<cstdio>#include<set>#include<list>#include<numeric>#include<cassert>#include<ctime>#include<bitset>using namespace std;const int INF =0x3f3f3f3f;const int MAXN = 100086;int mice[MAXN], arr[MAXN], chese[MAXN];int main(){#ifndef ONLINE_JUDGE freopen("in","r",stdin); freopen("out","w",stdout);#endif
for (int n, m; ~scanf("%d%d%*d%*d", &n, &m); ) { for (int i = 0; i < n; i++) { scanf("%d", &mice[i]);
} for (int i = 0; i < m; i ++) { scanf("%d", &chese[i]); } fill(arr, arr+m, INF); int ans = 0, now = 0; for (int i = 0; i < n ; i ++) { while(now + 1 < m && abs(mice[i]-chese[now+1]) < abs(mice[i]-chese[now])){ now++; } int left = now , right = now+1 < m && abs(mice[i]-chese[now+1]) == abs(mice[i]-chese[now]) ? now+1 : now; int dist = abs(mice[i] - chese[left]); if(arr[left] == INF) { ans ++; arr[left] = dist; } else if (arr[left] == dist) { ans ++; } else if(arr[left] > dist && left == right) {//闇瑕乴eft = right arr[left] = dist; } else if(left != right){ arr[right] = dist; ans++; } } printf("%d\n", n - ans); } return 0;}
]]>
/**//* 緇欏嚭n,k,b[]錛宯<=1000 b[i]琛ㄧず鏈鍚庤姹傜殑涓涓猲鐨勬帓鍒椾腑a[]錛宎[t] =i鐨勮繖涓暟宸﹁竟婊¤凍a[j]>=i+k鐨勪釜鏁?br> 姹傚瓧鍏稿簭鏈灝忕殑涓涓弧瓚充笂闈㈡潯浠舵帓鍒梐[] 涓嶄細璐績錛岀湅浜嗗埆浜虹殑 鐢ㄧ被浼兼嫇鎵戞帓搴忛偅鏍峰瓙錛屾瘡嬈″鎵炬渶灝忕殑鑰屼笖b[i] = 0鐨勮緭鍑猴紝 ------------------ Orz 鐒跺悗鏇存柊b[j], b[j]-- 鍏朵腑 i>=j+k 鍥犱負i宸茬粡鏀懼湪鍓嶉潰浜嗭紝鑷劧鍚庨潰鐨勯渶瑕乤[j]>=i+k鐨勪釜鏁板氨灝?浜?br>*/#include<iostream>#include<cstring>#include<map>#include<algorithm>#include<stack>#include<queue>#include<cmath>#include<string>#include<cstdlib>#include<vector>#include<cstdio>#include<set>#include<list>#include<numeric>#include<cassert>#include<ctime>#include<bitset>using namespace std;int main(){#ifndef ONLINE_JUDGE freopen("in","r",stdin);#endif for (int n, k; ~scanf("%d%d", &n, &k); ) { vector<int> b(n+1); for (int i = 1 ; i <= n ; i++) { scanf("%d", &b[i]); } for (int i = 1, j; i <= n; i ++) { for(j = 1; j <= n ; j++) { if(b[j] == 0){ break; } } if(i > 1){ putchar(' '); } cout<<j; b[j] = -1; for (int p = 1; p + k <= j; p++){ b[p] --; } } cout<<endl; } return 0;}
]]>
]]>
/**//* 涓昏鏄紝涓涓兘閲忓垵濮嬪間負S 緇欏嚭n涓娑堢伃鐨勬晫浜?br> 鎵撹觸姣忎釜鏁屼漢鑷沖皯瑕乧osti 錛岀劧鍚庡彲浠ヤ紤鎭紝鑾峰彇浣撳姏ri 闂兘鍚︽墦璐ユ墍鏈夋晫浜?br> n <= 22 鑻ヨ兘鎵撹觸鎵鏈夋晫浜猴紝鏈鍚庣殑鑳介噺鍊兼槸鍞竴鐨?br> 鍗沖畨鎺掍竴縐嶉『搴忚兘鎵撹觸鎵鏈夋晫浜?br> 瀵逛簬costi <= ri鐨勶紝鑲畾鏄厛鎵揷osti姣旇緝灝忕殑錛屾墍浠ユ寜鐓osti鍗囧簭鎺?br> 瀵逛簬costi > ri鐨勶紝鎴戞槸鎸塩osti闄嶅簭鎺掞紝閿欒 濡?br> 5 5 2 3 3 鐒跺悗鎸夌収 costi - ri 鍗囧簭鎺掞紝涔熼敊 濡?br> 5 3 2 5 3 姝ｇ‘鐨勬槸鎸夌収ri闄嶅簭鎺?br> 瑙ｉ鎶ュ憡璇磋窡zoj 3077綾諱技錛岃瘉鏄庢尯鏈夊惎紺虹殑 涓嶆槸涓鑸э紝鍋囪絳旀鐨勯『搴忔槸1,2..,n k-1 蹇呮湁 S - 鈭?costi - ri) >= costk i=1 鎴戜滑鍙互閫氳繃浜ゆ崲鎵鏈塺j < rj+1鐨勬晫浜猴紝浣嗘渶鍚庣粨鏋滀竴鏍鳳紒錛侊紒 鍥犱負 S' >= costj , S' - (costj - rj) >= costj+1 => S' >= costj+1 , S' - (costj+1 - rj+1) >= costj 鎵浠ュ儚鍐掓場鎺掑簭閭ｆ牱浜ゆ崲錛屾渶鍚庡艦鎴愪竴涓猺闄嶅簭鐨勫簭鍒楋紝浣嗘晥鏋滀竴鏍?br> 鑰寊oj 3077鎸夌収b闄嶅簭鍚庯紝dp閫夋嫨涓閮ㄥ垎鍑烘潵 鏁堟灉璺熸渶浼樿В鏄竴鏍風殑錛堟渶浼樿В鍏跺疄灝辨槸涓涓泦鍚?涓瀹氶『搴忥紝鑰岃繖涓『搴忚窡鎸夌収b闄嶅簭鏁堟灉涓鏍鳳紝 鑰岄夋嫨榪欎釜闆嗗悎灝辨槸dp浜嗭級 濡傛灉娌℃湁娌℃湁鎺掑簭錛岀洿鎺p灝變繚璇佷笉浜嗘棤鍚庢晥鎬?br> 鎴戞兂鏃犲悗鏁堟у氨鏄?nbsp;鍏堥塧鍐嶉塨 鏁堟灉璺?nbsp;鍏堥塨鍐嶉塧錛屼笉浼氬洜涓洪夋嫨浜哸灝變笉鑳介夋嫨b浜?br> 鎵浠ユ櫘閫氳儗鍖呴棶棰橈紝鎸夌収緙栧彿鐨勯『搴忚繘琛宒p灝辮浜?br> 涓ぇ絎笁鏈?#8221;鏁板瓧娓告垙“ 涔熸槸鍏堟帓搴忥紝鍦╠p閫夋嫨*/ #include<iostream>#include<cstring>#include<map>#include<algorithm>#include<stack>#include<queue>#include<cmath>#include<string>#include<cstdlib>#include<vector>#include<cstdio>#include<set>#include<list>using namespace std;const int INF = 1000000000;int main(){ int T; for(scanf("%d",&T);T--;){ int n , S; vector<pair<int,int> > less , _less; scanf("%d%d",&n,&S); for(int i = 0 ; i < n ; i++){ int p[3] , r; scanf("%d%d%d%d",&p[0],&p[1],&p[2],&r); int dp[10]; fill(dp,dp+10,INF); dp[0] = 0; for(int i = 0 ; i < 3 ; i++){ int get = 3 - i; for(int j = 0 ; j + get <= 9 ; j++){ dp[j+get] = min(dp[j+get] , dp[j] + p[i]); } } int cost = INF; for(int j = 7 ; j <= 9 ;j++){ cost = min(cost , dp[j]); } if(cost < r ){ less.push_back(make_pair(cost , r)); } else { _less.push_back(make_pair(r , cost)); } } sort(less.begin() , less.end()); sort(_less.begin() , _less.end(),greater<pair<int,int> >()); for(vector<pair<int,int> >::iterator it = less.begin() ; it != less.end() ; it++){ S -= it->first; if(S <= 0)break; S += it->second; } for(vector<pair<int,int> >::iterator it = _less.begin() ; it != _less.end() ; it++){ S -= it->second; if(S <= 0)break; S += it->first; } if(S > 0){ printf("%d\n",S); } else { puts("no"); } } return 0;}
]]>