Zengtudor/bdfz_2024_summer
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

update

Browse Source
This commit is contained in:
Zengtudor 2024-08-06 10:42:14 +08:00
parent 2c879c469f
commit a9704560e3
2 changed files with 7 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
.gitignore vendored
View File

@ -44,3 +44,4 @@ day2/U111091/out.txt
day2/U111091/fixed day2/U111091/fixed
day4/T435167/T435167 day4/T435167/T435167
day4/U461920/U461920 day4/U461920/U461920
test.txt

7
day4/U461920/U461920.cpp
View File

@ -6,9 +6,11 @@ using namespace std;
#ifdef DEBUG #ifdef DEBUG
#define PRINT_VALUE(v){cout<<#v<<" :"<<v<<endl;} #define PRINT_VALUE(v){cout<<#v<<" :"<<v<<endl;}
#define PRINT_ARRAY(arr,size){cout<<#arr<<" [";for(int i=1;i<=size;i++)cout<<arr[i]<<(i!=size?",":"]\n");}
#endif #endif
#ifndef DEBUG #ifndef DEBUG
#define PRINT_VALUE(v) #define PRINT_VALUE(v)
#define PRINT_ARRAY(arr,size)
#endif #endif
const int MAX_N=5*1e5+5; const int MAX_N=5*1e5+5;
@ -25,12 +27,15 @@ void set_num_times_mem(){
int main(){ int main(){
cin>>n; cin>>n;
set_num_times_mem(); set_num_times_mem();
PRINT_ARRAY(num_times,n);
for(int i=1;i<=n;i++){ for(int i=1;i<=n;i++){
cin>>arr[i]; cin>>arr[i];
num_times[arr[i]]++; num_times[arr[i]]++;
PRINT_VALUE(i); PRINT_VALUE(i);
PRINT_VALUE(arr[i]) PRINT_VALUE(arr[i]);
PRINT_VALUE(num_times[arr[i]]); PRINT_VALUE(num_times[arr[i]]);
PRINT_ARRAY(arr, n);
PRINT_ARRAY(num_times,n);
if (i==1) { if (i==1) {
ans=max(num_times[arr[i]],ans); ans=max(num_times[arr[i]],ans);
}else{ }else{