May 2024 | Mon | Tue | Wed | Thu | Fri | Sat | Sun |
---|
| | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | | | Calendar |
|
Top posting users this week | |
| | Mễ Văn Thuận | |
| | |
Tác giả | Thông điệp |
---|
mevanthuan
Tổng số bài gửi : 32 Join date : 09/05/2022
| Tiêu đề: BONSAI.cpp Tue Sep 27, 2022 8:01 pm | |
| - Code:
-
#include <bits/stdc++.h> using namespace std; void doctep(); void sub1(); void sub2(); void sub3(); void ghitep(); long n,k,a[1000000],s[1000000],f[1000000],res=INT_MIN,mres=0,sum=0; int main() { doctep(); //sub1(); sub2(); //sub3(); ghitep(); return 0; } void doctep() { ifstream fi("BONSAI.inp"); fi>>n>>k; for (long i=1;i<=n;i++) fi>>a[i]; fi.close(); } void sub1() { s[0]=0; s[1]=a[1]; long j; for (long i=2;i<=n;i++) { j=0; while (j<i) { j++; s[i]=s[i-1]+a[i]; f[i]=s[i-1]+a[i]-s[j-1]; if (i-j+1>=k) res=max(res,f[i]); } } } void sub2() { long i0,j0; for (long i=1;i<=n;i++) {
if (sum+a[i]<=a[i]) { i0=i; sum=a[i]; } else sum+=a[i]; if (mres<=sum) { j0=i; long d=i0; mres=sum; if (j0-d+1>=k) res=max(res,mres); else mres=0; } } } void sub3() { long i0,j0,d; for (long i=1;i<=n;i++) { mres+=a[i]; if (res<mres) { i0=i; res=mres; } if (mres<0) mres=0;
} } void ghitep() { ofstream fo("BONSAI.out"); fo<<res; fo.close(); }
| |
| | | mevanthuan
Tổng số bài gửi : 32 Join date : 09/05/2022
| Tiêu đề: SUBDIV.cpp Tue Sep 27, 2022 8:04 pm | |
| - Code:
-
#include <bits/stdc++.h> using namespace std; void doctep(); void sub1(); void sub2(); void ghitep(); long a[100000],s[100000]; long n,k,d=0; int main() { doctep(); sub1(); //sub2(); ghitep(); return 0; } void doctep() { ifstream fi("SUBDIV.inp"); fi>>n>>k; s[0]=0; s[1]=a[1]; for (int i=1;i<=n;i++) fi>>a[i]; fi.close(); } void sub1() { for (int i=1;i<=n;i++) s[i]=s[i-1]+a[i]; for (int i=1;i<=n;i++) for (int j=1;j<=i;j++) if ((s[i]-s[j-1])%k==0) d++;
} void sub2() { long sum=0,i0,j0,d0; for (int i=1;i<=n;i++) { sum+=a[i]; } } void ghitep() { ofstream fo("SUBDIV.out"); fo<<d; fo.close(); }
| |
| | | mevanthuan
Tổng số bài gửi : 32 Join date : 09/05/2022
| Tiêu đề: DRSEL.cpp Tue Sep 27, 2022 8:05 pm | |
| - Code:
-
#include <bits/stdc++.h> using namespace std; void doctep(); void thu(int i); void xuli(); void qhd(); void ghitep(); long long sa,sc,fx[20][20],a[20],c[20],r,res=-trunc(1e18); long n,b[20]; int main() { doctep(); //thu(1); qhd(); ghitep(); return 0; } void doctep() { ifstream fi("DRSEL.inp"); fi>>n>>r; for (int i=1;i<=n;i++) fi>>a[i]>>c[i]; fi.close(); } void thu(int i) { for (int j=0;j<=1;j++) { b[i]=j; if (i==n) xuli(); else thu(i+1); } } void xuli() { for (int i=1;i<=n;i++) if (b[i]==1) { sa+=a[i]; sc+=c[i]; if (sc>r) return; } res=max(res,sa); } void qhd() { for (int i=1;i<=n;i++) for (int j=1;j<=r;j++) if (a[i]<j) fx[i][j]=fx[i-1][j]; else fx[i][j]=max(fx[i-1][j],fx[i-1][j-c[i]]+a[i]); } void ghitep() { ofstream fo("DRSEL.out"); //fo<<res; fo<<fx[n][r]; fo.close(); }
| |
| | | mevanthuan
Tổng số bài gửi : 32 Join date : 09/05/2022
| Tiêu đề: BINSEARCH.cpp Tue Sep 27, 2022 8:06 pm | |
| - Code:
-
#include <bits/stdc++.h> using namespace std; void doctep(); long tknp(long u); void ghitep(); long n,q,a[100000],x; ofstream fo; int main() { fo.open("BINSEARCH.out"); doctep(); fo.close(); return 0; } void doctep() { ifstream fi("BINSEARCH.inp"); fi>>n>>q; for (int i=1;i<=n;i++) fi>>a[i]; for (int i=1;i<=q;i++) fi>>x; fo<<tknp(x)<<endl; fi.close(); } long tknp(long u) { long dau=1,cuoi=n; while (dau<=cuoi) { long giua=(dau+cuoi)/2; if (a[giua]>u) cuoi=giua-1; else if (a[giua]==u) return giua; else dau=giua+1; } return -1; }
| |
| | | mevanthuan
Tổng số bài gửi : 32 Join date : 09/05/2022
| Tiêu đề: CHIAKEO.cpp Tue Sep 27, 2022 9:25 pm | |
| - Code:
-
#include <bits/stdc++.h> #define ll 1000000000 using namespace std; void doctep(); void thu(int i); void xuat(); void ghitep(); long a[25],b[25],n,p=0; long long res=trunc(1e11); int main() { doctep(); thu(1); ghitep(); return 0; } void doctep() { ifstream fi("CHIAKEO.inp"); fi>>n; for (int i=1;i<=n;i++) fi>>a[i]; fi.close(); } void thu(int i) { for (int j=0;j<=1;j++) { b[i]=j; if (i==n) { xuat(); //if (p==1) re ; } else thu(i+1); } } void xuat() { long long s1=0,s2=0; for (int i=1;i<=n;i++) if (b[i]==1) s1+=a[i]; else s2+=a[i]; if (s1==s2) { p=1; return; } if (res>abs(s2-s1)) res=abs(s2-s1); } void ghitep() { ofstream fo("CHIAKEO.out"); if (p==1) fo<<0; else fo<<res; fo.close(); }
| |
| | | Sponsored content
| Tiêu đề: Re: Mễ Văn Thuận | |
| |
| | | | Mễ Văn Thuận | |
|
| Permissions in this forum: | Bạn được quyền trả lời bài viết
| |
| |
| |