fork(3) download
  1. #include<iostream>
  2. #include<algorithm>
  3. using namespace std;
  4. #define INF 10000000
  5.  
  6. int dp[25][30],n,h,f,s,a[25],ans,cnt=1,k,i,j;
  7.  
  8. int main()
  9. {
  10. // while(1)
  11. //{
  12. //cin>>n;
  13. n=4;
  14.  
  15. for(int i=0;i<=n;i++)
  16. for(int j=0;j<=n;j++)
  17. dp[i][j]=INF;
  18.  
  19.  
  20. //if(n==0)
  21. // break;
  22.  
  23. //for(int i=1;i<=n;i++)
  24. // cin>>a[i];
  25. a[1]=1;
  26. a[2]=2;
  27. a[3]=6;
  28. a[4]=10;
  29. //for( i=1;i<=n;i++) dp[i][1]=0;
  30.  
  31. for( j=2;j<=n;j++)
  32. {
  33. cout<<"j = "<<j<<"\n";
  34. for( i=1;i<=n;i++)
  35. {
  36. cout<<"i = "<<i<<"\n";
  37. int o=-1;
  38. for(k=1;k<i;k++)
  39. {
  40. o= max(o,min(dp[k][j-1],a[i]-a[k]));
  41. //cout<<o<<"\n";
  42. }
  43.  
  44. dp[i][j]=o;
  45. }
  46. }
  47.  
  48. for(i=1;i<=n;i++)
  49. {
  50. cout<<"\n";
  51. for(j=1;j<=n;j++)
  52. cout<<dp[i][j]<<" ";
  53. }
  54.  
  55. //}
  56. }
  57.  
  58.  
  59.  
Success #stdin #stdout 0s 3340KB
stdin
Standard input is empty
stdout
j = 2
i = 1
i = 2
i = 3
i = 4
j = 3
i = 1
i = 2
i = 3
i = 4
j = 4
i = 1
i = 2
i = 3
i = 4

10000000 -1 -1 -1 
10000000 1 -1 -1 
10000000 5 1 -1 
10000000 9 4 1