Advertisement
Guest User

Untitled

a guest
Jun 4th, 2018
130
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.54 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. //#include "grader.cpp"
  3.  
  4. using namespace std;
  5.  
  6.  
  7. int valuta (int N, int *H) {
  8.     int prefix[N], suffix[N];
  9.     prefix[0]=H[0];
  10.     suffix[N-1]=H[N-1];
  11.     for (int i=1; i<N; i++) prefix[i]=max(prefix[i-1], H[i]);
  12.     for (int i=N-2; i>=0; i--) suffix[i]=max(suffix[i+1], H[i]);
  13.    
  14.     int conto=0;
  15.    
  16.     for (int i=1; i<N-1; i++) if (prefix[i]!=H[i] && suffix[i]!=H[i]) conto++;
  17.     return conto;
  18.    
  19. }
  20.  
  21.  
  22. void progetta(int N, int K, int* H){
  23.     for (int i=0; i<N-K-2; i++) H[i]=i+1;
  24.     H[N-K-2]=N;
  25.     for (int i=N-K-1; i<N; i++) H[i]=i;
  26. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement