# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1138703 | AzeTurk810 | Horses (IOI15_horses) | C++20 | 0 ms | 0 KiB |
#include "horses.h"
#include "iostream"
int init(int N, int X[], int Y[]) {
cin>>N;
for(int i = 0; i < N;i++)
{
cin >> X[i];
}
for(int i =0 ;i<N;i++)
cin>>Y[i];
int ans=0,sum=1;
for(int i =0; i < N;i++)
ans=max(ans,sum*X[i]*Y[i]),sum*=X[i];
return ans;
}
int updateX(int pos, int val) {
return 0;
}
int updateY(int pos, int val) {
return 0;
}