Can someone help me understand the meaning of error message that I am getting here

# | User | Rating |
---|---|---|

1 | tourist | 3822 |

2 | Benq | 3745 |

3 | ksun48 | 3560 |

4 | Radewoosh | 3538 |

5 | peehs_moorhsum | 3532 |

6 | Um_nik | 3489 |

7 | maroonrk | 3424 |

8 | Petr | 3380 |

9 | sunset | 3338 |

10 | ecnerwala | 3336 |

# | User | Contrib. |
---|---|---|

1 | 1-gon | 206 |

2 | Errichto | 181 |

2 | awoo | 181 |

4 | Um_nik | 180 |

5 | -is-this-fft- | 175 |

6 | maroonrk | 174 |

7 | Radewoosh | 172 |

7 | tourist | 172 |

9 | SecondThread | 170 |

10 | rng_58 | 166 |

Can someone help me understand the meaning of error message that I am getting here

↑

↓

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/31/2021 14:50:14 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

this means that in jurys answer h[i]<=h[i+1] is 446 times and in your answer its 445 times.

Thank You. I got it.

maybe you haven't read the statement well.. the difficulty of the problem means number of element is not less then it's previous adjacent element(count of ar[i]<=ar[i+1]).. and you have to print the array such that the difference between 1st and last element is minimum and the difficulty is maximum.... so in your solution your difficulty count was not the maximum..

Well, it's clearly written in English but anyway. You have to maximize the difficulty score in the given problem while minimizing the difference between first and last element of the sequence. But your code doesn't gives the maximal difficulty. On test case 6, your code outputs a sequence with difficulty = 445, while the correct sequence has a difficulty = 446.