Submission #841358

#	Time	Username	Problem	Language	Result	Execution time	Memory
841358		alex_2008	K blocks (IZhO14_blocks)	C++14	Compilation error	0 ms	0 KiB

blocks

#include <iostream>using namespace std;const int N = 100100, K = 101;int dp[N][K], a[N], prevv[N], mn[N];int main() {	int n, k;	scanf("%d%d", &n, &k);	a[0] = 1e6 + 10;	for (int i = 1; i <= n; i++) {		scanf("%d", &a[i]);		int j = i - 1;		while (a[j] < a[i]) {			j = prevv[j];		}		prevv[i] = j;	}	dp[0][1] = 1e9 + 10;	dp[1][1]  = a[1];	for (int i = 2; i <= n; i++) {		dp[i][1] = max(dp[i - 1][1], a[i]);	}	for (int j = 2; j <= k; j++) {		for (int i = 1; i <= n; i++) {			mn[i] = 1e9 + 10;			int x = i - 1;			while (x != prevv[i]) {				mn[i] = min(mn[i], mn[x]);				x = prevv[x];			}			mn[i] = min(mn[i], dp[x][j - 1]);		}		for (int i = 0; i <= n; i++) {			if (i < j) dp[i][j] = 1e9 + 10;			else {				dp[i][j] = dp[prevv[i]][j];				dp[i][j] = min(dp[i][j], mn[i] + a[i]);			}		}	}	printf("%d\n", dp[n][k]);}

Compilation message (stderr)

blocks.cpp:1:26: warning: extra tokens at end of #include directive
    1 | #include <iostream>using namespace std;const int N = 100100, K = 101;int dp[N][K], a[N], prevv[N], mn[N];int main() { int n, k; scanf("%d%d", &n, &k); a[0] = 1e6 + 10; for (int i = 1; i <= n; i++) {  scanf("%d", &a[i]);  int j = i - 1;  while (a[j] < a[i]) {   j = prevv[j];  }  prevv[i] = j; } dp[0][1] = 1e9 + 10; dp[1][1]  = a[1]; for (int i = 2; i <= n; i++) {  dp[i][1] = max(dp[i - 1][1], a[i]); } for (int j = 2; j <= k; j++) {  for (int i = 1; i <= n; i++) {   mn[i] = 1e9 + 10;   int x = i - 1;   while (x != prevv[i]) {    mn[i] = min(mn[i], mn[x]);    x = prevv[x];   }   mn[i] = min(mn[i], dp[x][j - 1]);  }  for (int i = 0; i <= n; i++) {   if (i < j) dp[i][j] = 1e9 + 10;   else {    dp[i][j] = dp[prevv[i]][j];    dp[i][j] = min(dp[i][j], mn[i] + a[i]);   }  } } printf("%d\n", dp[n][k]);}
      |                          ^~~~~~~~~
blocks.cpp:1:10: fatal error: iostream>usin: No such file or directory
    1 | #include <iostream>using namespace std;const int N = 100100, K = 101;int dp[N][K], a[N], prevv[N], mn[N];int main() { int n, k; scanf("%d%d", &n, &k); a[0] = 1e6 + 10; for (int i = 1; i <= n; i++) {  scanf("%d", &a[i]);  int j = i - 1;  while (a[j] < a[i]) {   j = prevv[j];  }  prevv[i] = j; } dp[0][1] = 1e9 + 10; dp[1][1]  = a[1]; for (int i = 2; i <= n; i++) {  dp[i][1] = max(dp[i - 1][1], a[i]); } for (int j = 2; j <= k; j++) {  for (int i = 1; i <= n; i++) {   mn[i] = 1e9 + 10;   int x = i - 1;   while (x != prevv[i]) {    mn[i] = min(mn[i], mn[x]);    x = prevv[x];   }   mn[i] = min(mn[i], dp[x][j - 1]);  }  for (int i = 0; i <= n; i++) {   if (i < j) dp[i][j] = 1e9 + 10;   else {    dp[i][j] = dp[prevv[i]][j];    dp[i][j] = min(dp[i][j], mn[i] + a[i]);   }  } } printf("%d\n", dp[n][k]);}
      |          ^~~~~~~~~~~~~~~
compilation terminated.