]]>
ClamAV鏄竴涓湪鍛戒護琛屼笅鏌ユ瘨杞歡錛屽洜涓哄畠涓嶅皢鏉姣掍綔涓轟富瑕佸姛鑳斤紝榛樿鍙兘鏌ュ嚭鎮ㄨ綆楁満鍐呯殑鐥呮瘨錛屼絾鏄棤娉曟竻闄わ紝鑷沖鍒犻櫎鏂囦歡銆侰lamAV鍙互宸ヤ綔寰堝鐨勫鉤鍙頒笂錛屼絾鏄湁灝戞暟鏃犳硶鏀寔錛岃繖灝辮鍙栧喅鎮ㄦ墍浣跨敤鐨勫鉤鍙扮殑嫻佽紼嬪害浜嗐傚彟澶栧畠涓昏鏄潵闃叉姢涓浜沇INDOWS鐥呮瘨鍜屾湪椹▼搴忋傚彟澶栵紝榪欐槸涓涓潰鍚戞湇鍔＄鐨勮蔣浠躲?br />
闇瑕佸弽鐥呮瘨杞歡錛熷厤璐逛箞錛?/h4>
緇濆ぇ澶氭暟鐨凩inux閮芥槸寰堝厛榪涚殑錛屾墍浠ワ紝寰堝皯鏈夌梾姣掕兘澶熷湪linux涓婅繍琛屽拰綣佽銆傝屼笖錛岀敱浜庣洰鍓峆C閮戒嬌鐢ㄧ殑鏄疻indows錛屾墍浠ョ梾姣掑埗閫犺呬滑鏇存効鎰忓幓鍐橶indows涓嬬殑鐥呮瘨銆備絾鏄繕鏈夊緢澶氱殑鍘熷洜鑳借嚧浣挎偍浣跨敤涓浜涚梾姣掓壂鎻忕▼搴忕殑錛屾瘮濡傦細
- 鎵弿鍦ㄦ偍璁＄畻鏈轟笂鐨刉indows璁懼
- 鎵弿鍦ㄦ湰鍦扮綉緇滀腑鐨刉indows璁＄畻鏈?/li>
- 鎵弿鎮ㄥ嵆灝嗚浼犻佺粰鍒漢鐨勬枃浠?/li>
- 鎵弿鎮ㄥ皢瑕佸彂閫佺粰鍒漢鐨凟MAIL
ClamAV 瀹夎璁劇疆
瀹夎ClamAV
sudo apt-get install clamav
榪欓噷鏈変袱縐嶇殑ClamAV渚涙偍閫夋嫨 1.鎵嬪姩錛氬畨瑁匔lamAV鐨勫畨瑁呭寘 2.鑷姩錛氬畨瑁匔lamAV-daemon 榪欎袱縐嶉兘鍙互瀹夎ClamAV錛屼絾鏄鏄嬌鐢ㄤ笂闈㈢殑鏂規硶錛屾槸鎵嬪姩鐨勩?鍦ㄦ偍瀹夎瀹屾垚涔嬪悗錛屾偍鍙兘琚▼搴忛棶鍙婁竴浜涢棶棰橈紝姣斿鎬庝箞鍘誨崌綰с傝繖灝遍渶瑕佹偍閫夋嫨涓涓鎮ㄦ瘮杈冭繎鐨勬湇鍔″櫒鏉ュ崌綰с侰lamAV鐨勫崌綰х▼搴忔槸寰堝皬鐨勶紝鎵浠ュ緢鍊煎緱鍘昏嚜鍔ㄥ崌綰с?br />
鎬庝箞浣跨敤ClamAV
榪欓儴鍒嗗皢浼氫粙緇嶅畨瑁呬箣鍚庣殑浣跨敤
鍗囩駭鎴戠殑鐥呮瘨搴?/font>
榪愯 sudo freshclam.
鎮ㄥ皢浼氱湅瑙佷互涓嬭鏄?br />
user@ubuntu:/etc/clamav # sudo freshclam
ClamAV update process started at Wed Apr 27 00:06:47 2005
main.cvd is up to date (version: 31, sigs: 33079, f-level: 4, builder: tkojm)
daily.cvd is up to date (version: 855, sigs: 714, f-level: 4, builder: ccordes)
浣跨敤ClamAV鎵弿鎴戣綆楁満涓殑鏂囦歡
榪愯 clamscan.
榪欓噷闄勫甫涓浜涗緥瀛?br />
- 鎵弿鎵鏈夌敤鎴風殑涓葷洰褰曞氨浣跨敤 clamscan -r /home
- 鎵弿鎮ㄨ綆楁満涓婄殑鎵鏈夋枃浠跺茍涓旀樉紺烘墍鏈夌殑鏂囦歡鐨勬壂鎻忕粨鏋滐紝灝變嬌鐢?clamscan -r /
- 鎵弿鎮ㄨ綆楁満涓婄殑鎵鏈夋枃浠跺茍涓旀樉紺烘湁闂鐨勬枃浠剁殑鎵弿緇撴灉錛?灝變嬌鐢?clamscan -r --bell -i /
- 褰揷lamAV鎵弿瀹屾墍鏈夋枃浠剁殑鏃跺欙紝浼氭樉紺哄涓嬬殑綾諱技鎶ュ憡
ClamAV鍙細鍘繪壂鎻忓浜嶤lamAV鍙互璇誨彇鐨勬枃浠躲?濡傛灉鎮ㄦ兂鎵弿鎵鏈夋枃浠訛紝鍦ㄥ懡浠ゅ墠鍔犱笂 sudo .
浣緾lamAV浠aemon闃叉姢鐨勬柟寮忚繍琛?/font>
瀹夎clamav-daemon灝卞彲浠ヤ簡錛宑lamav-daemon灝嗕細寤虹珛涓涓悕涓?clamav'鐨勫笎鎴鳳紝榪欐槸涓轟簡鍙互浣緾lamAV鎵弿涓浜涚郴緇熸枃浠訛紝姣斿鎮ㄧ殑Email瀛樻斁鐨勫湴鏂癸紝鎮ㄥ彲浠ユ坊鍔?clamav'涓鴻繖浜涙枃浠舵垨鑰呯洰褰曠殑鎵鏈夎呫?br />
濡備綍鐭ラ亾clamav-daemon鏄惁榪愯浜?
鏌ョ湅榪涚▼鍒楄〃灝卞彲浠ヤ簡:
ps ax | grep [c]lamd
濡備綍鍒犻櫎鐥呮瘨鏂囦歡錛?/font>
鍦ㄦ壂鎻忕殑鏃跺欙紝鎮ㄥ彲浠ユ坊鍔?--remove'
濡備綍鐭ラ亾鎴戠幇鍦ㄤ嬌鐢ㄧ殑ClamAV鐗堟湰錛?/font>
鎵ц clamscan -V
濡備綍浣緾lamAV鎸夎鍒掕嚜鍔ㄨ繍琛?/font>
鎮ㄥ彲浠ヤ嬌鐢?at'鍛戒護鏉ヤ嬌clamscan鍜宖reshclam榪愯錛屾瘮濡?
at 3:30 tomorrow
at>clamscan -i /home/user > mail user@example.com
at> <CTRL-D>
job 3 at 2015-03-10 03:30
鎴栬呯紪杈?/etc/crontab 鍔犲叆浠ヤ笅鍐呭
0 3 * * * root /usr/bin/freshclam --quiet -l /var/log/clamav/clamav.log 錛冿純姣忓ぉ3鐐瑰崌綰?br />
鏇村鍐呭璇峰弬瑙?a target="_blank">Ubuntu涓枃紺懼尯ClamAV涓撴爮銆?
]]>
ClamAV update process started at Wed Apr 27 00:06:47 2005
main.cvd is up to date (version: 31, sigs: 33079, f-level: 4, builder: tkojm)
daily.cvd is up to date (version: 855, sigs: 714, f-level: 4, builder: ccordes)
at>clamscan -i /home/user > mail user@example.com
at> <CTRL-D>
job 3 at 2015-03-10 03:30
void MERGE(int *A, int p,int q, int r) {
int B[maxn] , i = p , j = q+1 , k = 0;
while(k < r - p + 1) {
if(i > q || j <= r && A[i] > A[j]) B[k++] = A[j++];
else B[k++] = A[i++];
}
for(i=0;i<r-p+1;i++) A[p+i] = B[i];
}
int B[maxn] , i = p , j = q+1 , k = 0;
while(k < r - p + 1) {
if(i > q || j <= r && A[i] > A[j]) B[k++] = A[j++];
else B[k++] = A[i++];
}
for(i=0;i<r-p+1;i++) A[p+i] = B[i];
}
2.3-5 浜屽垎鏌ユ壘鐨凜++浠ｇ爜
int find(int *a, int l, int r, int value) {
if(l == r) return l;
int mid = (l+r) >> 1;
if(a[mid] >= value) return find(a, l, mid, value);
else return find(a , mid+1, r , value);
}
if(l == r) return l;
int mid = (l+r) >> 1;
if(a[mid] >= value) return find(a, l, mid, value);
else return find(a , mid+1, r , value);
}
*2.3-7 錛堣繖閬撻鍏跺疄鏈塐(n)鐨勭畻娉曪紝鑰屼笖鍐欒搗鏉ユ洿鏂逛究浜涳級榪欓噷鏄疧(nlogn)鐨勭畻娉?br /> O(nlogn)綆楁硶鎬濇兂錛?.棣栧厛榪涜鎺掑簭錛?.鐒跺悗鏋氫婦姣忎竴涓皬浜庣瓑浜巟/2鐨勬暟S[i]錛屼簩鍒嗘煡鎵懼搴旂殑x-S[i]鏄惁瀛樺湪
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1010;
bool findx(int *S,int n, int x,int l,int r) {
if(l > r) return false;
if(l ==r) return S[l] == x;
int mid = (l+r) >> 1;
if(S[mid] >= x) return findx(S, n, x, l, mid);
else return findx(S, n, x, mid+1, r);
}
bool check(int *S,int n,int x) {
for(int i=0;S[i]<=x/2 && i < n;i++) {
if(findx(S, n, x-S[i], i+1, n-1)) return true;
}
return false;
}
int main() {
int S[1010] , x , n;
while(~scanf("%d%d" , &n , &x)) {
for(int i=0;i<n;i++) cin >> S[i];
if(check(S, n, x)) puts("yes");
else puts("no");
}
return 0;
}
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1010;
bool findx(int *S,int n, int x,int l,int r) {
if(l > r) return false;
if(l ==r) return S[l] == x;
int mid = (l+r) >> 1;
if(S[mid] >= x) return findx(S, n, x, l, mid);
else return findx(S, n, x, mid+1, r);
}
bool check(int *S,int n,int x) {
for(int i=0;S[i]<=x/2 && i < n;i++) {
if(findx(S, n, x-S[i], i+1, n-1)) return true;
}
return false;
}
int main() {
int S[1010] , x , n;
while(~scanf("%d%d" , &n , &x)) {
for(int i=0;i<n;i++) cin >> S[i];
if(check(S, n, x)) puts("yes");
else puts("no");
}
return 0;
}
O(n)鐨勬柟娉曟槸鍦ㄦ暟鐨勮寖鍥翠笉鏄壒鍒ぇ鐨勬椂鍊欙紙鎴栬呮暟鐨勮寖鍥存瘮杈冨ぇ錛屾鏃墮噰鐢╤ash鐨勬柟娉曪級鏍囪鐨勬柟娉曪紝榪欓噷鍋囪鏁扮殑鑼冨洿<=10000錛屽茍涓斿亣璁炬暟娌℃湁閲嶅鐨勬儏鍐典笅錛屽叾浠栨儏鍐電◢璁告敼鍙樹竴涓嬪氨琛岋細
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1010;
bool check(int *S,int n,int x) {
bool vis[10001] = {0};
for(int i=0;i<n;i++) vis[x-S[i]] = true;
for(int i=0;i<n;i++) if(vis[S[i]]) return true;
return false;
}
int n ,x , S[maxn];
int main() {
while(~scanf("%d%d" , &n , &x)) {
for(int i=0;i<n;i++) cin >> S[i];
if(check(S, n, x)) puts("yes");
else puts("no");
}
return 0;
}
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1010;
bool check(int *S,int n,int x) {
bool vis[10001] = {0};
for(int i=0;i<n;i++) vis[x-S[i]] = true;
for(int i=0;i<n;i++) if(vis[S[i]]) return true;
return false;
}
int n ,x , S[maxn];
int main() {
while(~scanf("%d%d" , &n , &x)) {
for(int i=0;i<n;i++) cin >> S[i];
if(check(S, n, x)) puts("yes");
else puts("no");
}
return 0;
}
2-4錛堥嗗簭瀵癸級錛氳繖閬撻灝辨槸鍦ㄥ綊騫舵帓搴忎腑寰楀埌閫嗗簭瀵癸紝鍏蜂綋瑙佷唬鐮侊細
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1010;
int ans;
void merge_sort(int *A, int l,int r) {
if(l >= r) return;
int mid = (l+r) >> 1;
merge_sort(A, l, mid);
merge_sort(A, mid+1, r);
int i = l , j = mid+1 ,B[maxn] , k = l;
while(i <= mid || j <= r) {
if(i > mid || j <= r && A[j] < A[i]) B[k++] = A[j++] , ans += mid-i+1;
else B[k++] = A[i++];
}
for(i=l;i<=r;i++) A[i] = B[i];
}
int main() {
int A[maxn] , n;
while(~scanf("%d" , &n)) {
for(int i=0;i<n;i++) cin >> A[i];
ans = 0;
merge_sort(A, 0, n-1);
cout << ans << endl;
//for(int i=0;i<n;i++) cout << A[i] << " "; cout << endl;
}
return 0;
}
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 1010;
int ans;
void merge_sort(int *A, int l,int r) {
if(l >= r) return;
int mid = (l+r) >> 1;
merge_sort(A, l, mid);
merge_sort(A, mid+1, r);
int i = l , j = mid+1 ,B[maxn] , k = l;
while(i <= mid || j <= r) {
if(i > mid || j <= r && A[j] < A[i]) B[k++] = A[j++] , ans += mid-i+1;
else B[k++] = A[i++];
}
for(i=l;i<=r;i++) A[i] = B[i];
}
int main() {
int A[maxn] , n;
while(~scanf("%d" , &n)) {
for(int i=0;i<n;i++) cin >> A[i];
ans = 0;
merge_sort(A, 0, n-1);
cout << ans << endl;
//for(int i=0;i<n;i++) cout << A[i] << " "; cout << endl;
}
return 0;
}
]]>
]]>
鏈塏縐嶇墿鍝佸拰涓涓閲忎負V鐨勮儗鍖呫傜i縐嶇墿鍝佹渶澶氭湁n[i]浠跺彲鐢紝姣忎歡璐圭敤鏄痗[i]錛屼環鍊兼槸w[i]銆傛眰瑙ｅ皢鍝簺鐗╁搧瑁呭叆鑳屽寘鍙嬌榪欎簺鐗╁搧鐨勮垂鐢ㄦ誨拰涓嶈秴榪囪儗鍖呭閲忥紝涓斾環鍊兼誨拰鏈澶с?/p>
鍩烘湰綆楁硶
榪欓鐩拰瀹屽叏鑳屽寘闂寰堢被浼箋傚熀鏈殑鏂圭▼鍙渶灝嗗畬鍏ㄨ儗鍖呴棶棰樼殑鏂圭▼鐣ュ井涓鏀瑰嵆鍙紝鍥犱負瀵逛簬絎琲縐嶇墿鍝佹湁n[i]+1縐嶇瓥鐣ワ細鍙?浠訛紝鍙?浠?#8230;…鍙杗[i]浠躲備護f[i][v]琛ㄧず鍓峣縐嶇墿鍝佹伆鏀懼叆涓涓閲忎負v鐨勮儗鍖呯殑鏈澶ф潈鍊鹼紝鍒欐湁鐘舵佽漿縐繪柟紼嬶細
f[i][v]=max{f[i-1][v-k*c[i]]+k*w[i]|0<=k<=n[i]}
澶嶆潅搴︽槸O(V*Σn[i])銆?/p>
杞寲涓?1鑳屽寘闂
鍙︿竴縐嶅ソ鎯沖ソ鍐欑殑鍩烘湰鏂規硶鏄漿鍖栦負01鑳屽寘姹傝В錛氭妸絎琲縐嶇墿鍝佹崲鎴恘[i]浠?1鑳屽寘涓殑鐗╁搧錛屽垯寰楀埌浜嗙墿鍝佹暟涓?#931;n[i]鐨?1鑳屽寘闂錛岀洿鎺ユ眰瑙ｏ紝澶嶆潅搴︿粛鐒舵槸O(V*Σn[i])銆?/p>
浣嗘槸鎴戜滑鏈熸湜灝嗗畠杞寲涓?1鑳屽寘闂涔嬪悗鑳藉鍍忓畬鍏ㄨ儗鍖呬竴鏍烽檷浣庡鏉傚害銆備粛鐒惰冭檻浜岃繘鍒剁殑鎬濇兂錛屾垜浠冭檻鎶婄i縐嶇墿鍝佹崲鎴愯嫢騫蹭歡鐗╁搧錛屼嬌寰楀師闂涓i縐嶇墿鍝佸彲鍙栫殑姣忕絳栫暐——鍙?..n[i]浠?#8212;—鍧囪兘絳変環浜庡彇鑻ュ共浠朵唬鎹互鍚庣殑鐗╁搧銆傚彟澶栵紝鍙栬秴榪噉[i]浠剁殑絳栫暐蹇呬笉鑳藉嚭鐜般?/p>
鏂規硶鏄細灝嗙i縐嶇墿鍝佸垎鎴愯嫢騫蹭歡鐗╁搧錛屽叾涓瘡浠剁墿鍝佹湁涓涓郴鏁幫紝榪欎歡鐗╁搧鐨勮垂鐢ㄥ拰浠峰煎潎鏄師鏉ョ殑璐圭敤鍜屼環鍊間箻浠ヨ繖涓郴鏁般備嬌榪欎簺緋繪暟鍒嗗埆涓?,2,4,...,2^(k-1),n[i]-2^k+1錛屼笖k鏄弧瓚硁[i]-2^k+1>0鐨勬渶澶ф暣鏁般備緥濡傦紝濡傛灉n[i]涓?3錛屽氨灝嗚繖縐嶇墿鍝佸垎鎴愮郴鏁板垎鍒負1,2,4,6鐨勫洓浠剁墿鍝併?/p>
鍒嗘垚鐨勮繖鍑犱歡鐗╁搧鐨勭郴鏁板拰涓簄[i]錛岃〃鏄庝笉鍙兘鍙栧浜巒[i]浠剁殑絎琲縐嶇墿鍝併傚彟澶栬繖縐嶆柟娉曚篃鑳戒繚璇佸浜?..n[i]闂寸殑姣忎竴涓暣鏁幫紝鍧囧彲浠ョ敤鑻ュ共涓郴鏁扮殑鍜岃〃紺猴紝榪欎釜璇佹槑鍙互鍒?..2^k-1鍜?^k..n[i]涓ゆ鏉ュ垎鍒璁哄緱鍑猴紝騫朵笉闅撅紝甯屾湜浣犺嚜宸辨濊冨皾璇曚竴涓嬨?/p>
榪欐牱灝卞皢絎琲縐嶇墿鍝佸垎鎴愪簡O(log n[i])縐嶇墿鍝侊紝灝嗗師闂杞寲涓轟簡澶嶆潅搴︿負<math>O(V*Σlog n[i])鐨?1鑳屽寘闂錛屾槸寰堝ぇ鐨勬敼榪涖?/p>
涓嬮潰緇欏嚭O(log amount)鏃墮棿澶勭悊涓浠跺閲嶈儗鍖呬腑鐗╁搧鐨勮繃紼嬶紝鍏朵腑amount琛ㄧず鐗╁搧鐨勬暟閲忥細
procedure MultiplePack(cost,weight,amount)
if cost*amount>=V
CompletePack(cost,weight)
return
integer k=1
while k<amount
ZeroOnePack(k*cost,k*weight)
amount=amount-k
k=k*2
ZeroOnePack(amount*cost,amount*weight)
甯屾湜浣犱粩緇嗕綋浼氳繖涓吉浠ｇ爜錛屽鏋滀笉澶悊瑙ｇ殑璇濓紝涓嶅Θ緲昏瘧鎴愮▼搴忎唬鐮佷互鍚庯紝鍗曟鎵ц鍑犳錛屾垨鑰呭ご鑴戝姞綰哥瑪妯℃嫙涓涓嬶紝涔熻灝變細鎱㈡參鐞嗚В浜嗐?/p>
O(VN)鐨勭畻娉?/h2>
澶氶噸鑳屽寘闂鍚屾牱鏈塐(VN)鐨勭畻娉曘傝繖涓畻娉曞熀浜庡熀鏈畻娉曠殑鐘舵佽漿縐繪柟紼嬶紝浣嗗簲鐢ㄥ崟璋冮槦鍒楃殑鏂規硶浣挎瘡涓姸鎬佺殑鍊煎彲浠ヤ互鍧囨憡O(1)鐨勬椂闂存眰瑙ｃ傜敱浜庣敤鍗曡皟闃熷垪浼樺寲鐨凞P宸茶秴鍑轟簡NOIP鐨勮寖鍥達紝鏁呮湰鏂囦笉鍐嶅睍寮璁茶В銆傛垜鏈鍒濅簡瑙ｅ埌榪欎釜鏂規硶鏄湪妤煎ぉ鎴愮殑“鐢蜂漢鍏”騫葷伅鐗囦笂銆?/p>
灝忕粨
榪欓噷鎴戜滑鐪嬪埌浜嗗皢涓涓畻娉曠殑澶嶆潅搴︾敱O(V*Σn[i])鏀硅繘鍒癘(V*Σlog n[i])鐨勮繃紼嬶紝榪樼煡閬撲簡瀛樺湪搴旂敤瓚呭嚭NOIP鑼冨洿鐨勭煡璇嗙殑O(VN)綆楁硶銆傚笇鏈涗綘鐗瑰埆娉ㄦ剰“鎷嗗垎鐗╁搧”鐨勬濇兂鍜屾柟娉曪紝鑷繁璇佹槑涓涓嬪畠鐨勬紜э紝騫跺皢瀹屾暣鐨勭▼搴忎唬鐮佸啓鍑烘潵銆?/p>