DP basic 455A codeforces

  1. // DP practice
  2. // 455A --- codeforces
  3. #include <iostream>
  4. #include <stdio.h>
  5. #include <cstring>
  6. using namespace std;
  7. const int N = 1000010;
  8. long long int dp[N];
  9. long long int cnt[N];
  10. int main()
  11. {
  12. int iT;
  13. int iNum,iLarge;
  14. int i,j;
  15. cin >> iT;
  16. memset(cnt,0,sizeof(cnt));
  17. iLarge = 0;
  18. for ( i=0 ; i<iT ; i++ )   
  19.     {
  20.     cin >> iNum;
  21.     // count number appear times
  22.     cnt [iNum]++;
  23.     // store the largest number to reduce run time
  24.     if ( iNum>iLarge )
  25.         iLarge = iNum;
  26.     }
  27. dp[0] = 0;
  28. dp[1] = cnt[1];
  29. for ( j=2 ; j<=iLarge ; j++ )
  30.     dp[j] = max(dp[j-1],dp[j-2] + (cnt[j]*j)); 
  31.        
  32. cout << dp[j-1] << endl;   
  33. }

DETAIL:
ex:    input 2 --  1  2
cnt[1] = 1        cnt[2] = 2                        2 different number
dp[0] = 0        dp[1] = 1                         拿第一種的情況
dp[2] = max ( dp[1], dp[0] + 1*2 )     拿第二種的情況

 ex:   input 9 -- 1 2 1 3 2 2 2 2 3
cnt[1] = 2   cnt[2] = 5    cnt[3] = 2       3 different number
dp[0] = 0    dp[1] = 1                              拿第一種的情況
dp[2] = max ( dp[1],  dp[0]+2*5 )       拿第二種的情況
dp[3] = max (dp[2], dp[1] + 3*2 )        拿第三種的情況 




留言

張貼留言

這個網誌中的熱門文章

Codeforces --- string task

Petya started to attend programming lessons. On the first lesson his task was to write a simple program. The program was supposed to do the following: in the given string, consisting if uppercase and lowercase Latin letters, it: deletes all the vowels, inserts a character " . " before each consonant, replaces all uppercase consonants with corresponding lowercase ones. Vowels are letters "A", "O", "Y", "E", "U", "I", and the rest are consonants. The program's input is exactly one string, it should return the output as a single string, resulting after the program's processing the initial string. Help Petya cope with this easy task. Input The first line represents input string of Petya's program. This string only consists of uppercase and lowercase Latin letters and its length is from  1  to  100 , inclusive. Output Print the resulting string. It is guaranteed that this string is
閱讀完整內容

Uva 674 ---- coin change

圖片
// coin change #include <iostream> using   namespace  std ; int  main ( ) { int  iCoin [ 7490 ] [ 5 ] ; int  iMoney [ 5 ]   =   {   1 ,  5 ,  10  ,  25 ,  50   } ; int  iAmount, i ,j, iMax ; while   (   cin   >>  iAmount  )      {     iMax  =   - 1 ;        for   (  i = 0   ;  i <= iAmount  ;  i ++   )           iCoin [ i ] [ 0 ]   =   1 ;      for   (  j = 0   ;  j < 5   ;  j ++   )         iCoin [ 0 ] [ j ]   =   1 ;      for   (  i = 1   ;  i <= iAmount  ;  i ++   )                for   (  j = 1   ;  j < 5   ;  j ++   )              {              if   (  i - iMoney [ j ]   >=   0   )                 iCoin [ i ] [ j ]   =   (  iCoin [ i ] [ j - 1 ]   +  iCoin [ i - iMoney [ j ] ] [ j ]   ) ;                  else                 iCoin [ i ] [ j ]   =  iCoin [ i ] [ j - 1 ] ;                                  }      /*          for ( i=0 ; i<iAmount ; i++ )               {
閱讀完整內容

codeforces 271A --- beautiful year

BEAUTIFUL YEAR It seems like the year of 2013 came only yesterday. Do you know a curious fact? The year of 2013 is the first year after the old 1987 with only distinct digits. Now you are suggested to solve the following problem: given a year number, find the minimum year number which is strictly larger than the given one and has only distinct digits. Input The single line contains integer  y   (1000 ≤  y  ≤ 9000)  — the year number. Output Print a single integer — the minimum year number that is strictly larger than  y  and all it's digits are distinct. It is guaranteed that the answer exists. Examples input 1987 output 2013 input 2013 output 2014 #include <iostream> using   namespace  std ; int  iFind  (   int  iIn  ) { int  iFlag ;   int  iBucket [ 10 ] ; for   (   int  i = 0   ;  i < 10   ;  i ++   )     iBucket [ i ]   =   0 ; iFlag  =   0 ; while   (  iIn  )      {      if   (  iBucket [
閱讀完整內容