CSU 1578 Opening ceremony (recursive)

Test instructions: There is a row of n buildings each high uncertainty now to eliminate all buildings

There are two ways to eliminate all blocks with a value of 1.

2 elimination of an entire building

Ask how to eliminate it with minimal steps

Idea: First sort the array from large to small

     if (I+a[i]<ans) ans=i+a[i];

#include <cstdio> #include <cstring> #include <algorithm>using namespace Std;int a[1000000+100];int CMP (int a,int b) {    return a>b;} int main () {    int n;    int i,j,k;    while (scanf ("%d", &n)!=eof)    {        int ans;        for (i=0;i<n;i++) scanf ("%d", &a[i]);        Sort (a,a+n,cmp);        ANS=A[0];        printf ("%d\n", ans);        for (i=1;i<n;i++)        {            if (I+a[i]<ans) ans=i+a[i];        }        if (ans>n) ans=n;        printf ("%d\n", ans);    }    return 0;}

　　

CSU 1578 Opening ceremony (recursive)