#include <cstdio> #include <cstring> #include <cmath> #include <cassert> #include <iostream> #include <algorithm> #include <iterator> #include <string> #include <vector> #include <queue> #include <bitset> #include <utility> #include <stack> #include <numeric> using namespace std; typedef long long LL; typedef pair<int,int> PII; typedef vector<int> VI; #define MP make_pair #define FOR(v,p,k) for(int v=(p);v<=(k);++v) #define FORD(v,p,k) for(int v=(p);v>=(k);--v) #define REP(i,n) for(int i=0;i<(n);++i) #define VAR(v,i) __typeof(i) v=(i) #define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i) #define PB push_back #define ST first #define ND second #define SIZE(x) (int)x.size() #define ALL(c) c.begin(),c.end() #define ODD(x) ((x)%2) #define EVEN(x) (!(ODD(x))) void check(VI &a, VI &b, int n) { b.clear(); b.PB(0); bool res = true; FOR(i, 1, n) { LL mx = a[1], sum = 0; FOR(j, 1, i) { LL cur_mx = a[j] - sum; sum += b[i-j]; if (cur_mx < mx) { mx = cur_mx; } //printf("%d\n", mx); } if (sum + mx != a[i]) { res = false; } b.PB(mx); } printf("%s\n", res ? "TAK" : "NIE"); if (res) { printf("%d\n", n); FOR(j, 1, n) { printf("%d%s", b[j], (j==n)? "\n" : " "); } /** vector<LL> best(n+1, numeric_limits<LL>::min()); FOR(i, 1, n) { LL sum = 0; FOR(j, i, n) { sum += b[j]; assert(sum <= a[j-i+1]); best[j-i+1] = max(best[j-i+1], sum); } } FOR(i, 1, n) { //printf("%lld %lld\n", best[i], a[i]); assert(best[i] == a[i]); } */ } } int main() { int n; scanf("%d\n", &n); VI a; a.reserve(n+1); a.PB(0); REP(i, n) { int k; scanf("%d", &k); a.PB(k); } VI b; b.reserve(n+1); check(a, b, n); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 | #include <cstdio> #include <cstring> #include <cmath> #include <cassert> #include <iostream> #include <algorithm> #include <iterator> #include <string> #include <vector> #include <queue> #include <bitset> #include <utility> #include <stack> #include <numeric> using namespace std; typedef long long LL; typedef pair<int,int> PII; typedef vector<int> VI; #define MP make_pair #define FOR(v,p,k) for(int v=(p);v<=(k);++v) #define FORD(v,p,k) for(int v=(p);v>=(k);--v) #define REP(i,n) for(int i=0;i<(n);++i) #define VAR(v,i) __typeof(i) v=(i) #define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i) #define PB push_back #define ST first #define ND second #define SIZE(x) (int)x.size() #define ALL(c) c.begin(),c.end() #define ODD(x) ((x)%2) #define EVEN(x) (!(ODD(x))) void check(VI &a, VI &b, int n) { b.clear(); b.PB(0); bool res = true; FOR(i, 1, n) { LL mx = a[1], sum = 0; FOR(j, 1, i) { LL cur_mx = a[j] - sum; sum += b[i-j]; if (cur_mx < mx) { mx = cur_mx; } //printf("%d\n", mx); } if (sum + mx != a[i]) { res = false; } b.PB(mx); } printf("%s\n", res ? "TAK" : "NIE"); if (res) { printf("%d\n", n); FOR(j, 1, n) { printf("%d%s", b[j], (j==n)? "\n" : " "); } /** vector<LL> best(n+1, numeric_limits<LL>::min()); FOR(i, 1, n) { LL sum = 0; FOR(j, i, n) { sum += b[j]; assert(sum <= a[j-i+1]); best[j-i+1] = max(best[j-i+1], sum); } } FOR(i, 1, n) { //printf("%lld %lld\n", best[i], a[i]); assert(best[i] == a[i]); } */ } } int main() { int n; scanf("%d\n", &n); VI a; a.reserve(n+1); a.PB(0); REP(i, n) { int k; scanf("%d", &k); a.PB(k); } VI b; b.reserve(n+1); check(a, b, n); return 0; } |