Submission #91299

#TimeUsernameProblemLanguageResultExecution timeMemory
91299YottaByteK blocks (IZhO14_blocks)C++14
0 / 100
600 ms263168 KiB
#include <stdio.h> #include <iomanip> #include <vector> #include <algorithm> using namespace std; const int N = 1e5; #define pb push_back #define ll long long #define int long long #define fr first #define sc second #define mk make_pair ll sum, ans = 2e9; int n, a[N + 1], k, t[N * 4]; vector < pair < int, int > > lr[201]; void bld(int v = 1, int l = 1, int r = n) { if(l == r) { t[v] = a[l]; return; } else { int mid = l + r >> 1; bld(v + v, l, mid); bld(v + v + 1, mid + 1, r); } t[v] = max(t[v + v], t[v + v + 1]); } void brute(int l, int r, int q) { if(q == 1) { //printf("%lld %lld %lld\n\n", k - q + 1, l, n); lr[k - q].pb( mk( l, n ) ); return; } if(l == n) return; else { for(int i = r; i <= n - q + 1; i++) { //printf("%lld %lld %lld\n", k - q + 1, l, i); lr[k - q].pb( mk( l, i ) ); brute(i + 1, i + 1, q - 1); } } } int getmx(int ql, int qr, int v = 1, int l = 1, int r = n) { if(l > qr || ql > r) return 0; if(ql <= l && r <= qr) return t[v]; int mid = l + r >> 1; return max(getmx(ql, qr, v + v, l, mid), getmx(ql, qr, v + v + 1, mid + 1, r)); } void calc(int cur, int q, ll psum = 0, int prer = 0) { if(q == 0) { ans = min(ans, psum); return; } else { for(int i = 0; i < lr[cur].size(); i++) { if(lr[cur][i].fr <= prer); else calc(cur + 1, q - 1, psum + getmx(lr[cur][i].fr, lr[cur][i].sc), lr[cur][i].sc); } } } main() { scanf("%lld %lld", &n, &k); //scanf("%d %d", &n, &k); for(int i = 1; i <= n; i++) scanf("%lld", &a[i]), sum += a[i]; //scanf("%d", &a[i]), sum += a[i]; bld(); brute(1, 1, k); calc(0, k); printf("%lld", ans); } /** 5 3 1 2 3 4 5 **/

Compilation message (stderr)

blocks.cpp: In function 'void bld(long long int, long long int, long long int)':
blocks.cpp:29:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~
blocks.cpp: In function 'long long int getmx(long long int, long long int, long long int, long long int, long long int)':
blocks.cpp:61:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = l + r >> 1;
            ~~^~~
blocks.cpp: In function 'void calc(long long int, long long int, long long int, long long int)':
blocks.cpp:74:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < lr[cur].size(); i++)
                  ~~^~~~~~~~~~~~~~~~
blocks.cpp: At global scope:
blocks.cpp:82:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
blocks.cpp: In function 'int main()':
blocks.cpp:84:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
blocks.cpp:87:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &a[i]), sum += a[i];
   ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...