oj.uz

Submission #376302

# Submission time Handle Problem Language Result Execution time Memory
376302 2021-03-11T08:01:26 Z maomao90 Bigger segments (IZhO19_segments) C++14
0 / 100
 1 ms 364 KB 
// https://oj.uz/problem/view/IZhO19_segments
#include <bits/stdc++.h>
using namespace std;

#define mnto(x, y) x = min(x, (__typeof__(x)) y)
#define mxto(x, y) x = max(x, (__typeof__(x)) y)
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb emplace_back
typedef vector<int> vi;
typedef vector<ii> vii;

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 3005

int n;
int a[MAXN];
int dp[MAXN][MAXN], ans;

ll sum(int s, int e) {
	return (ll) a[e] - (s == 0 ? 0ll : (ll) a[s - 1]);
}

int main() {
	scanf("%d", &n);
	REP (i, 0, n) scanf("%d", &a[i]);
	REP (i, 1, n) {
		a[i] += a[i - 1];
	}
	ans = 1;
	REP (i, 0, n) {
		dp[i][0] = 1;
		REP (j, 1, i + 1) {
			RREP (k, j - 1, 0) {
				if (sum(k, j - 1) > sum(j, i)) break;
				mxto(dp[i][j], dp[k][j - 1] + 1);
				mxto(ans, dp[i][j]);
			}
// 			printf("%d %d: %d\n", j, i, dp[i][j]);
		}
	}
	printf("%d\n", ans);
	return 0;
}

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
segments.cpp:38:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |  REP (i, 0, n) scanf("%d", &a[i]);
      |                ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -