# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
234179 | pere_gil | Horses (IOI15_horses) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include "horses.h"
using namespace std;
init(int N, int X, int Y)
{
int big=0;
int ja[N];
ja[0]=X[0];
for(int i=1;i<N;i++){
ja[i]=ja[i-1]*X[i];
}
for(int i=0;i<N;i++) big=max(big, ja[i]*Y[i]);
return big;
}