摘要:
最长上升子序列dp法 #include<bits/stdc++.h> #define M 100005 using namespace std; int a[M]={0,389,207,155,300,299,170,158,65}; int dp[M]; int main(){ int len = 阅读全文
摘要:
There are N light bulbs indexed from 00 to N−1. Initially, all of them are off. A FLIP operation switches the state of a contiguous subset of bulbs. F 阅读全文
摘要:
array Time Limit: 1500ms Memory Limit: 256M Description You are given an array . Initially, each element of the array is unique.Moreover, there are in 阅读全文