Submission #1674594
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <cmath> #include <cstdio> #include <functional> #include <numeric> #include <stack> #include <queue> #include <map> #include <set> #include <utility> #include <sstream> #include <complex> #include <fstream> #include <bitset> #include <time.h> #include <tuple> using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef vector<ll> V; typedef complex<double> Point; #define PI acos(-1.0) #define EPS 1e-10 const ll INF = 1e12; const ll MOD = 1e9 + 7; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define rep(i,N) for(int i=0;i<(N);i++) #define ALL(s) (s).begin(),(s).end() #define EQ(a,b) (abs((a)-(b))<EPS) #define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) ) #define fi first #define se second #define N_SIZE (1LL << 20) #define NIL -1 #define MAX_N 100100 * 3 int m, n, k; ll a[100100]; ll dp[100100][100]; int main() { cin >> n >> m >> k; rep(i, n) { cin >> a[i]; dp[i][1] = a[i]; } rep(i, n) { FOR(j, 1, m + 1) { FOR(l, 1, k + 1) { if (i - j >= 0) { dp[i][l] = max(dp[i][l], dp[i - j][l - 1] + l*a[i]); } } } } //rep(i, n) { // rep(j, k + 1) { // // } //} ll ans = 0; rep(i, n) { ans = max(ans, dp[i][k]); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Struck Out |
User | jimmy |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1381 Byte |
Status | WA |
Exec Time | 2104 ms |
Memory | 79104 KB |
Judge Result
Set Name | Sample | subtask1 | subtask2 | subtask3 | All | ||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | 0 / 200 | 0 / 300 | 0 / 100 | ||||||||||||||||||||||||
Status |
|
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt |
subtask1 | sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
subtask2 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt |
subtask3 | sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt |
All | sample_1.txt, sample_2.txt, sample_3.txt, sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_1.txt | AC | 1 ms | 256 KB |
sample_2.txt | AC | 1 ms | 256 KB |
sample_3.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | AC | 2 ms | 384 KB |
subtask_1_2.txt | TLE | 2103 ms | 8448 KB |
subtask_1_3.txt | TLE | 2104 ms | 79104 KB |
subtask_1_4.txt | AC | 1168 ms | 4352 KB |
subtask_1_5.txt | TLE | 2104 ms | 79104 KB |
subtask_1_6.txt | WA | 10 ms | 384 KB |
subtask_1_7.txt | TLE | 2104 ms | 79104 KB |
subtask_1_8.txt | TLE | 2104 ms | 79104 KB |
subtask_1_9.txt | WA | 81 ms | 640 KB |
subtask_2_1.txt | AC | 4 ms | 512 KB |
subtask_2_2.txt | AC | 1 ms | 512 KB |
subtask_2_3.txt | AC | 2 ms | 512 KB |
subtask_2_4.txt | AC | 3 ms | 384 KB |
subtask_2_5.txt | WA | 1 ms | 256 KB |
subtask_2_6.txt | WA | 1 ms | 256 KB |
subtask_2_7.txt | AC | 2 ms | 512 KB |
subtask_2_8.txt | AC | 3 ms | 512 KB |
subtask_2_9.txt | AC | 3 ms | 512 KB |
subtask_3_1.txt | TLE | 2104 ms | 79104 KB |
subtask_3_2.txt | TLE | 2104 ms | 79104 KB |
subtask_3_3.txt | TLE | 2104 ms | 79104 KB |
subtask_3_4.txt | TLE | 2104 ms | 64384 KB |
subtask_3_5.txt | AC | 1114 ms | 4352 KB |
subtask_3_6.txt | AC | 366 ms | 79104 KB |
subtask_3_7.txt | TLE | 2104 ms | 79104 KB |
subtask_3_8.txt | AC | 1075 ms | 8448 KB |
subtask_3_9.txt | AC | 589 ms | 79104 KB |
subtask_4_1.txt | TLE | 2104 ms | 79104 KB |
subtask_4_10.txt | WA | 98 ms | 79104 KB |
subtask_4_11.txt | WA | 473 ms | 79104 KB |
subtask_4_12.txt | WA | 889 ms | 79104 KB |
subtask_4_13.txt | TLE | 2104 ms | 79104 KB |
subtask_4_2.txt | TLE | 2104 ms | 79104 KB |
subtask_4_3.txt | TLE | 2104 ms | 79104 KB |
subtask_4_4.txt | TLE | 2104 ms | 79104 KB |
subtask_4_5.txt | TLE | 2104 ms | 79104 KB |
subtask_4_6.txt | TLE | 2104 ms | 79104 KB |
subtask_4_7.txt | TLE | 2104 ms | 79104 KB |
subtask_4_8.txt | TLE | 2104 ms | 78848 KB |
subtask_4_9.txt | TLE | 2104 ms | 79104 KB |